On Steiner 2-edge connected polytopes. - Ali Ridha Mahjoub; Pierre Pesneau (Electron. Notes Discret. Math., 2000)

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. - David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (SIAM J. Discret. Math., 2004)

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. - Bernard Fortz; Ali Ridha Mahjoub; S. Thomas McCormick; Pierre Pesneau (Math. Program., 2006)

On extended formulations for the precedence constrained asymmetric traveling salesman problem. - Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2006)

On the k edge-disjoint 2-hop-constrained paths polytope. - Geir Dahl; David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (Oper. Res. Lett., 2006)

On facets of stable set polytopes of claw-free graphs with stability number three. - Arnaud Pêcher; Pierre Pesneau; Annegret Wagler (Electron. Notes Discret. Math., 2007)

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. - David Huygens; Martine Labbé; Ali Ridha Mahjoub; Pierre Pesneau (Networks, 2007)

On the Steiner 2-edge connected subgraph polytope. - Ali Ridha Mahjoub; Pierre Pesneau (RAIRO Oper. Res., 2008)

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Pierre Pesneau (Electron. Notes Discret. Math., 2010)

Feasibility Pump Heuristics for Column Generation Approaches. - Pierre Pesneau; Ruslan Sadykov; François Vanderbeck (SEA, 2012)

Reliable Service Allocation in Clouds with Memory and Capacity Constraints. - Olivier Beaumont; Lionel Eyraud-Dubois; Pierre Pesneau; Paul Renaud-Goud (Euro-Par Workshops, 2013)

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Pierre Pesneau (Discret. Appl. Math., 2014)

Circuit and bond polytopes on series-parallel graphs. - Sylvie Borne; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001; Pierre Pesneau (Discret. Optim., 2015)

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. - I. Diarrassouba; Virginie Gabrel; Ali Ridha Mahjoub; Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2016)

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. - Luis Gouveia 001; Pierre Pesneau; Mario Ruthmair; Daniel Santos 003 (Networks, 2018)

Exact approaches for solving a covering problem with capacitated subtrees. - François Clautiaux; Jérémy Guillot; Pierre Pesneau (Comput. Oper. Res., 2019)

Node based compact formulations for the Hamiltonian p-median problem. - Michele Barbato; Francisco Canas; Luís Gouveia 001; Pierre Pesneau (Networks, 2023)