The following pages link to Pierre Pesneau (Q496645):
Displaying 15 items.
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- (Q2816114) (← links)
- (Q2861531) (← links)
- (Q3109940) (← links)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number three (Q3439583) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem (Q4584873) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra (Q4652637) (← links)
- Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)
