Pierre Pesneau

According to our database, Pierre Pesneau authored at least 17 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Node based compact formulations for the Hamiltonian <i>p</i>-median problem.

Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau

Networks, December, 2023

2019

Exact approaches for solving a covering problem with capacitated subtrees.

François Clautiaux, Jérémy Guillot, Pierre Pesneau

Comput. Oper. Res., 2019

2018

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.

Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos

Networks, 2018

2016

Integer programming formulations for the <i>k</i>-edge-connected 3-hop-constrained network design problem.

I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau

Networks, 2016

2015

Circuit and bond polytopes on series-parallel graphs.

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau

Discret. Optim., 2015

2014

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem.

Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau

Discret. Appl. Math., 2014

2013

Reliable Service Allocation in Clouds with Memory and Capacity Constraints.

Olivier Beaumont, Lionel Eyraud-Dubois, Pierre Pesneau, Paul Renaud-Goud

Proceedings of the Euro-Par 2013: Parallel Processing Workshops, 2013

2012

Feasibility Pump Heuristics for Column Generation Approaches.

Pierre Pesneau, Ruslan Sadykov, François Vanderbeck

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2010

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem.

Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau

Electron. Notes Discret. Math., 2010

2008

On the Steiner 2-edge connected subgraph polytope.

Ali Ridha Mahjoub, Pierre Pesneau

RAIRO Oper. Res., 2008

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 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

2006

On the <i>k</i> edge-disjoint 2-hop-constrained paths polytope.

Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau

Oper. Res. Lett., 2006

On extended formulations for the precedence constrained asymmetric traveling salesman problem.

Luis Eduardo Neves Gouveia, Pierre Pesneau

Networks, 2006

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

2004

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra.

David Huygens, Ali Ridha Mahjoub, Pierre Pesneau

SIAM J. Discret. Math., 2004

2000

On Steiner 2-edge connected polytopes.

Ali Ridha Mahjoub, Pierre Pesneau

Electron. Notes Discret. Math., 2000