scientific article; zbMATH DE number 2064405
From MaRDI portal
Publication:4461904
zbMath1113.90360MaRDI QIDQ4461904
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (17)
Branching rules revisited ⋮ New techniques for cost sharing in combinatorial optimization games ⋮ Good triangulations yield good tours ⋮ The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ A note on the polytope of bipartite TSP ⋮ Optimally solving the joint order batching and picker routing problem ⋮ A data-guided lexisearch algorithm for the asymmetric traveling salesman problem ⋮ Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity ⋮ George Dantzig's contributions to integer programming ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ Tolerance-based branch and bound algorithms for the ATSP ⋮ Lower tolerance-based branch and bound algorithms for the ATSP ⋮ A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone ⋮ A minimum spanning tree based heuristic for the travelling salesman tour ⋮ On the facial structure of symmetric and graphical traveling salesman polyhedra ⋮ Compact formulations of the Steiner traveling salesman problem and related problems
This page was built for publication:
