scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey traveling salesman branch and bound methods empirical analysis

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Vehicle routing with split deliveries, Scheduling in a sequence dependent setup environment with genetic search, A new algorithm for the propositional satisfiability problem, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A light-propagation model for aircraft trajectory planning, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, On the relationship between ATSP and the cycle cover problem, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, A note on the complexity of the asymmetric traveling salesman problem, The traveling salesman problem with backhauls, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, Submodularity and the traveling salesman problem, A study of complexity transitions on the asymmetric traveling salesman problem, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, A data-guided lexisearch algorithm for the asymmetric traveling salesman problem, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, A hybrid mathematical model for flying sidekick travelling salesman problem with time windows, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, On the stochastic complexity of the asymmetric traveling salesman problem, A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Maxx: Test pattern optimisation with local search over an extended logic, Exploiting relaxation in local search for LABS, The traveling salesman problem: An overview of exact and approximate algorithms, Analysis of the Held-Karp lower bound for the asymmetric TSP, Construction heuristics for the asymmetric TSP., Predicting optimal solution cost with conditional probabilities, Tolerance-based branch and bound algorithms for the ATSP, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Genetic algorithm for combinatorial path planning: the subtour problem, Branch and cut methods for network optimization, The multiagent planning problem, Iterative state-space reduction for flexible computation, Potential-based bounded-cost search and anytime non-parametric A*, Performance of linear-space search algorithms, Performance of linear-space search algorithms, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, On patching algorithms for random asymmetric travelling salesman problems, Constrained spanning trees and the traveling salesman problem, Estimating the Held-Karp lower bound for the geometric TSP, Low-complexity algorithms for sequencing jobs with a fixed number of job-classes, Heuristics for the flow line problem with setup costs, A new variant of a vehicle routing problem: Lower and upper bounds, Average-case analysis of best-first search in two representative directed acyclic graphs