default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre-Louis Poirion
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Pierre-Louis Poirion:
Programmation linéaire mixte robuste; Application au dimensionnement d'un système hybride de production d'électricité. (Robust mixed integer linear programming; Application to the design of an hybrid system for electricity production). Conservatoire national des arts et métiers, Paris, France, 2013
Journal Articles
- 2023
- [j16]Leo Liberti
, Benedetto Manca, Pierre-Louis Poirion:
Random Projections for Linear Programming: An Improved Retrieval Phase. ACM J. Exp. Algorithmics 28: 2.2:1-2.2:33 (2023) - [j15]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated Steiner trees and networks with uniform demands. Networks 82(1): 3-31 (2023) - 2022
- [j14]Terunari Fuji, Pierre-Louis Poirion, Akiko Takeda:
Convexification with Bounded Gap for Randomly Projected Quadratic Optimization. SIAM J. Optim. 32(2): 874-899 (2022) - 2020
- [j13]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
Algorithms and applications for a class of bilevel MILPs. Discret. Appl. Math. 272: 75-89 (2020) - [j12]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for quadratic programs. Math. Program. 183(1): 619-647 (2020) - 2019
- [j11]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Gaussian random projections for Euclidean membership problems. Discret. Appl. Math. 253: 93-102 (2019) - [j10]Pierre-Louis Poirion:
Optimal constraints aggregation method for ILP. Discret. Appl. Math. 262: 148-157 (2019) - 2018
- [j9]Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn:
Bilevel Model for Adaptive Network Flow Problem. Electron. Notes Discret. Math. 64: 105-114 (2018) - [j8]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. Electron. Notes Discret. Math. 64: 365-374 (2018) - [j7]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j6]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Random Projections for Linear Programming. Math. Oper. Res. 43(4): 1051-1071 (2018) - 2016
- [j5]Pierre-Louis Poirion:
Robust linear programming; optimal sizing of an hybrid energy stand-alone system. 4OR 14(1): 103-104 (2016) - [j4]Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Solving LP using random projections. Electron. Notes Discret. Math. 55: 53-56 (2016) - [j3]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
Robust optimal sizing of a hybrid energy stand-alone system. Eur. J. Oper. Res. 254(2): 565-575 (2016) - [j2]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
The power edge set problem. Networks 68(2): 104-120 (2016) - 2014
- [j1]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
2-stage robust MILP with continuous recourse variables. Discret. Appl. Math. 170: 21-32 (2014)
Conference and Workshop Papers
- 2022
- [c7]Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Practical Performance of Random Projections in Linear Programming. SEA 2022: 21:1-21:15 - 2019
- [c6]Ky Khac Vu, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Random Projections for Quadratic Programs over a Euclidean Ball. IPCO 2019: 442-452 - [c5]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Sonia Toubaline:
On the Observability of Smart Grids and Related Optimization Methods. OR 2019: 281-287 - 2018
- [c4]Pierre-Louis Poirion, Jeremie Leguay, Liu Ruosi:
Scalable request routing for VR-ready CDNs. ICIN 2018: 1-6 - 2017
- [c3]Lorenzo Maggi, Pierre-Louis Poirion, Jeremie Leguay:
Reroute backward to better break deadlocks. CloudNet 2017: 95-100 - 2016
- [c2]Dimitri Watel, Pierre-Louis Poirion:
The Maximum Matrix Contraction Problem. ISCO 2016: 426-438 - 2015
- [c1]Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Observing the State of a Smart Grid Using Bilevel Programming. COCOA 2015: 364-376
Informal and Other Publications
- 2023
- [i7]Dimitri Watel, Pierre-Louis Poirion:
The Maximum Matrix Contraction Problem. CoRR abs/2306.01349 (2023) - 2021
- [i6]Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for conic programs. CoRR abs/2101.04182 (2021) - 2018
- [i5]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated trees and networks with uniform demands. CoRR abs/1801.04696 (2018) - [i4]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. CoRR abs/1806.06704 (2018) - 2017
- [i3]Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau:
Adaptive Network Flow with k-Arc Destruction. CoRR abs/1711.00831 (2017) - 2015
- [i2]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Using the Johnson-Lindenstrauss lemma in linear and integer programming. CoRR abs/1507.00990 (2015) - [i1]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Gaussian random projections for Euclidean membership problems. CoRR abs/1509.00630 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
