On a time-dependent formulation and an updated classification of ATSP formulations
From MaRDI portal
Recommendations
- A classification of formulations for the (time-dependent) traveling salesman problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Natural and extended formulations for the time-dependent traveling salesman problem
Cited in
(8)- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Load-dependent and precedence-based models for pickup and delivery problems
- Natural and extended formulations for the time-dependent traveling salesman problem
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- New path elimination constraints for multi-depot routing problems
- Solving the family traveling salesman problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
This page was built for publication: On a time-dependent formulation and an updated classification of ATSP formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109940)
