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). - Pierre-Louis Poirion (2013)

2-stage robust MILP with continuous recourse variables. - Alain Billionnet; Marie-Christine Costa; Pierre-Louis Poirion (Discret. Appl. Math., 2014)

Observing the State of a Smart Grid Using Bilevel Programming. - Sonia Toubaline; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (COCOA, 2015)

Using the Johnson-Lindenstrauss lemma in linear and integer programming. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (CoRR, 2015)

The Maximum Matrix Contraction Problem. - Dimitri Watel; Pierre-Louis Poirion (ISCO, 2016)

Robust linear programming; optimal sizing of an hybrid energy stand-alone system. - Pierre-Louis Poirion (4OR, 2016)

Solving LP using random projections. - Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (Electron. Notes Discret. Math., 2016)

Robust optimal sizing of a hybrid energy stand-alone system. - Alain Billionnet; Marie-Christine Costa; Pierre-Louis Poirion (Eur. J. Oper. Res., 2016)

The power edge set problem. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Networks, 2016)

Reroute backward to better break deadlocks. - Lorenzo Maggi; Pierre-Louis Poirion; Jeremie Leguay (CloudNet, 2017)

Adaptive Network Flow with k-Arc Destruction. - Thomas Ridremont; Dimitri Watel; Pierre-Louis Poirion; Christophe Picouleau (CoRR, 2017)

Scalable request routing for VR-ready CDNs. - Pierre-Louis Poirion; Jeremie Leguay; Liu Ruosi (ICIN, 2018)

Robust capacitated trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (CoRR, 2018)

Bilevel Model for Adaptive Network Flow Problem. - Jean-François Baffier; Pierre-Louis Poirion; Vorapong Suppakitpaisarn (Electron. Notes Discret. Math., 2018)

Formulations for designing robust networks. An application to wind power collection. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Electron. Notes Discret. Math., 2018)

Complexity and inapproximability results for the Power Edge Set problem. - Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Baruch Schieber; Hadas Shachnai (J. Comb. Optim., 2018)

Random Projections for Linear Programming. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (Math. Oper. Res., 2018)

Random Projections for Quadratic Programs over a Euclidean Ball. - Ky Khac Vu; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (IPCO, 2019)

On the Observability of Smart Grids and Related Optimization Methods. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Sonia Toubaline (OR, 2019)

Optimal constraints aggregation method for ILP. - Pierre-Louis Poirion (Discret. Appl. Math., 2019)

Gaussian random projections for Euclidean membership problems. - Ky Khac Vu; Pierre-Louis Poirion; Leo Liberti (Discret. Appl. Math., 2019)

Algorithms and applications for a class of bilevel MILPs. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Discret. Appl. Math., 2020)

Random projections for quadratic programs. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (Math. Program., 2020)

Random projections for conic programs. - Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (CoRR, 2021)

Practical Performance of Random Projections in Linear Programming. - Leo Liberti; Benedetto Manca; Pierre-Louis Poirion (SEA, 2022)

Convexification with Bounded Gap for Randomly Projected Quadratic Optimization. - Terunari Fuji; Pierre-Louis Poirion; Akiko Takeda (SIAM J. Optim., 2022)

Robust capacitated Steiner trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Networks, 2023)

Random Projections for Linear Programming: An Improved Retrieval Phase. - Leo Liberti; Benedetto Manca; Pierre-Louis Poirion (ACM J. Exp. Algorithmics, 2023)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization. - Rei Higuchi; Pierre-Louis Poirion; Akiko Takeda (ICLR, 2025)

Zeroth-Order Random Subspace Algorithm for Non-smooth Convex Optimization. - Ryota Nozawa; Pierre-Louis Poirion; Akiko Takeda (J. Optim. Theory Appl., 2025)

Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method. - Andi Han; Pierre-Louis Poirion; Akiko Takeda (CoRR, 2025)