A restricted Lagrangean approach to the traveling salesman problem
From MaRDI portal
Publication:3911684
Cites work
- scientific article; zbMATH DE number 3646634 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3566552 (Why is no real title available?)
- A NEW PRACTICAL SOLUTION FOR LARGE-SCALE TRAVELING SALESMAN PROBLEM
- Combinatorial Optimization: What is the State of the Art
- Cutting planes from conditional bounds: A new approach to set covering
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Technical Note—Bounds for the Travelling-Salesman Problem
- The Shortest Hamiltonian Chain of a Graph
- The Traveling Salesman Problem: A Survey
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Travelling Salesman and Assignment Problems: A Survey
Cited in
(50)- A relax-and-cut algorithm for the set partitioning problem
- Exact algorithms for the vertex separator problem in graphs
- A set covering reformulation of the pure fixed charge transportation problem
- The multiple-robot assembly plan problem
- New lower bounds for the triplanar assignment problem. Use of the classical model
- On dual solutions of the linear assignment problem
- A Lagrangian relaxation approach to the edge-weighted clique problem
- An inexact algorithm for the sequential ordering problem
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Discrete optimization by optimal control methods. II: The static traveling salesman problem
- Heuristic methods and applications: A categorized survey
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Facets of the three-index assignment polytope
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- New lower bounds for the symmetric travelling salesman problem
- Minimum directed 1-subtree relaxation for score orienteering problem
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
- New edges not used in shortest tours of TSP
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Matheuristics: survey and synthesis
- Cluster based branching for the asymmetric traveling salesman problem
- Nonlinear resolving functions for the travelling salesman problem
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- A branch and bound algorithm for the capacitated vehicle routing problem
- Dynamic bundle methods
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- The three-dimensional assignment and partition problems. New lower bounds
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- Lagrangean relaxation. (With comments and rejoinder).
- Transforming asymmetric into symmetric traveling salesman problems
- Travelling salesman problem tools for microcomputers
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
- On the stochastic complexity of the asymmetric traveling salesman problem
- A production planning problem in FMS
- Non delayed relax-and-cut algorithms
- Analysis of the Held-Karp lower bound for the asymmetric TSP
- Approximate algorithms for the traveling salesman problem. II
- An additive bounding procedure for the asymmetric travelling salesman problem
- Recent trends in combinatorial optimization
- Heuristics for the flow line problem with setup costs
- Maximum travelling salesman problem. I
- Better assignment lower bounds for the Euclidean traveling salesman problem
- The symmetric travelling salesman problem. II: New low bounds
- Decomposition and dynamic cut generation in integer linear programming
- Shuffling heuristics for the storage location assignment in an AS/RS
- Some facets of the simple plant location polytope
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
This page was built for publication: A restricted Lagrangean approach to the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911684)
