The following pages link to Mathieu Lacroix (Q418001):
Displaying 23 items.
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- (Q496632) (redirect page) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- Lexicographical polytopes (Q1707907) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Efficient formulations for the traveling car renter problem and its quota variant (Q2047185) (← links)
- The Schrijver system of the flow cone in series-parallel graphs (Q2064292) (← links)
- On \(k\)-edge-connected polyhedra: box-TDIness in series-parallel graphs (Q2225046) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Trader multiflow and box-TDI systems in series-parallel graphs (Q2419363) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- (Q2861508) (← links)
- (Q2861536) (← links)
- Tree based heuristics for the preemptive asymmetric stacker crane problem (Q2883548) (← links)
- Recourse problem of the 2-stage robust location transportation problem (Q2883563) (← links)
- Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks (Q3167617) (← links)
- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem (Q3167618) (← links)
- The <i>st</i>-bond polytope on series-parallel graphs (Q4611490) (← links)
