scientific article; zbMATH DE number 3799403
From MaRDI portal
zbMath0506.90059MaRDI QIDQ4744064
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyheuristicsLagrangian relaxationtravelling salesman problemreviewstate space relaxationinteger programming formulationshortest spanning treeLP-based algorithmsdynamic programming formulation2-matching algorithmsbounds in branching schemesexistence of hamiltonian circuits
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems, Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem, The travelling salesman problem with pick-up and delivery, Heuristics for unequal weight delivery problems with a fixed error guarantee, Heuristics and bounds for the travelling salesman location problem on the plane, An approximation algorithm for the TSP, A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem, Worst case bounds for the Euclidean matching problem, On the relationship between the biconnectivity augmentation and traveling salesman problems, Maximum bounded 3-dimensional matching is MAX SNP-complete, Analysis of Christofides' heuristic: some paths are more difficult than cycles, The traveling salesman problem: An overview of exact and approximate algorithms, Analysis of the Held-Karp lower bound for the asymmetric TSP, A note on relatives to the Held and Karp 1-tree problem, On the solutions of stochastic traveling salesman problems, Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation, Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns, On approximating the minimum independent dominating set, Combinatorial optimisation algorithms for a CAD workstation, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, A stochastic dynamic traveling salesman problem with hard time windows, Worst-case analysis of two travelling salesman heuristics, Set-up saving schemes for printed circuit boards assembly, A cutting plane procedure for the travelling salesman problem on road networks
