Pierre Pesneau

Available identifiers

Publication	Date of Publication	Type
Node based compact formulations for the Hamiltonian p‐median problem	2024-01-18	Paper
Exact approaches for solving a covering problem with capacitated subtrees	2019-02-19	Paper
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem	2018-09-04	Paper
Circuit and bond polytopes on series-parallel graphs	2018-05-24	Paper
Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem	2018-05-23	Paper
On Steiner 2-edge connected polytopes	2016-07-01	Paper
Natural and extended formulations for the time-dependent traveling salesman problem	2015-09-22	Paper
Hop-indexed circuit-based formulations for the traveling salesman problem	2013-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q3109940	2012-01-26	Paper
On the Steiner 2-edge connected subgraph polytope	2009-01-29	Paper
On the \(k\) edge-disjoint 2-hop-constrained paths polytope	2008-03-28	Paper
On facets of stable set polytopes of claw-free graphs with stability number three	2007-05-29	Paper
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut	2007-02-02	Paper
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut	2006-01-13	Paper
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra	2005-02-28	Paper

This page was built for person: Pierre Pesneau