A New Formulation for the Travelling Salesman Problem
From MaRDI portal
(Redirected from Publication:3315280)
Recommendations
- A new approach to solve the traveling salesman problem
- A new generalization of the traveling salesman problem
- A new heuristic for the traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- A new formulation and approach for the black and white traveling salesman problem
- A new formulation for the traveling deliveryman problem
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 1796965 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- A Simultaneous Enumeration Approach to the Traveling Salesman Problem
- On a linear-programming, combinatorial approach to the traveling-salesman problem
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Solution of a Large-Scale Traveling-Salesman Problem
- The Shortest Hamiltonian Chain of a Graph
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(45)- Compact formulations of the Steiner traveling salesman problem and related problems
- Two mixed integer programming formulations arising in manufacturing management
- New Bounds for the Traveling Salesman Constant
- A new heuristic for the traveling salesman problem
- Formulations and branch-and-cut algorithms for the period travelling salesman problem
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- An analytical comparison of different formulations of the travelling salesman problem
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- Routing optimization under uncertainty
- On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- Node based compact formulations for the Hamiltonian p‐median problem
- Integer programming formulations for the elementary shortest path problem
- A new mathematical programming formulation for the single-picker routing problem
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Routing optimization with time windows under uncertainty
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- A new formulation and approach for the black and white traveling salesman problem
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- Models and algorithms for the time window assignment traveling salesperson problem with stochastic travel times
- Classification of travelling salesman problem formulations
- Solution algorithms for synchronous flow shop problems with two dominating machines
- scientific article; zbMATH DE number 3880463 (Why is no real title available?)
- Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
- Natural and extended formulations for the time-dependent traveling salesman problem
- Two-commodity opposite direction network flow formulations for the travelling salesman problem
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- Formulations for the orienteering problem with additional constraints
- Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
- New Monitoring Parameter for the Traveling Salesman Problem
- Identification of unidentified equality constraints for integer programming problems
- Development of new artificial intelligence systems for solving the travelling salesman problem
- On symmetric subtour problems
- An alternate formulation of the symmetric traveling salesman problem and its properties
- Combined route capacity and route length models for unit demand vehicle routing problems
- Tight lower bounds for the traveling salesman problem with draft limits
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- Hop-indexed circuit-based formulations for the traveling salesman problem
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
- A bilevel programming approach to the travelling salesman problem.
- A survey of variants and extensions of the location-routing problem
This page was built for publication: A New Formulation for the Travelling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315280)
