Pierre Pesneau

17 papers B 1Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Node based compact formulations for the Hamiltonian
Networks
Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau
2019 J jnl
Exact approaches for solving a covering problem with capacitated subtrees.
Comput. Oper. Res.
François Clautiaux, Jérémy Guillot, Pierre Pesneau
2018 J jnl
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.
Networks
Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos
2016 J jnl
Integer programming formulations for the
Networks
I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau
2015 J jnl
Circuit and bond polytopes on series-parallel graphs.
Discret. Optim.
Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau
2014 J jnl
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem.
Discret. Appl. Math.
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau
2013 — conf
Reliable Service Allocation in Clouds with Memory and Capacity Constraints.
Euro-Par Workshops
Olivier Beaumont, Lionel Eyraud-Dubois, Pierre Pesneau, Paul Renaud-Goud
2012 B conf
Feasibility Pump Heuristics for Column Generation Approaches.
SEA
Pierre Pesneau, Ruslan Sadykov, François Vanderbeck
2010 J jnl
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem.
Electron. Notes Discret. Math.
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau
2008 J jnl
On the Steiner 2-edge connected subgraph polytope.
RAIRO Oper. Res.
Ali Ridha Mahjoub, Pierre Pesneau
2007 J jnl
On facets of stable set polytopes of claw-free graphs with stability number three.
Electron. Notes Discret. Math.
Arnaud Pêcher, Pierre Pesneau, Annegret K. Wagler
2007 J jnl
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
Networks
David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau
2006 J jnl
On extended formulations for the precedence constrained asymmetric traveling salesman problem.
Networks
Luis Eduardo Neves Gouveia, Pierre Pesneau
2006 J jnl
On the
Oper. Res. Lett.
Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
2006 J jnl
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program.
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau
2004 J jnl
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra.
SIAM J. Discret. Math.
David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
2000 J jnl
On Steiner 2-edge connected polytopes.
Electron. Notes Discret. Math.
Ali Ridha Mahjoub, Pierre Pesneau