The following pages link to (Q3714901):
Displaying 22 items.
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Optimal solutions for the cutting stock problem (Q1825768) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
- Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
