The traveling salesman problem. Approximate algorithms
From MaRDI portal
Publication:917453
zbMath0704.90095MaRDI QIDQ917453
S. I. Sergeev, I. I. Melamed, I. Kh. Sigal
Publication date: 1989
Published in: Automation and Remote Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (31)
Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ On sequential traversal of sets ⋮ One task of routing jobs in high radiation conditions ⋮ Method of scaling in approximate solution of the traveling salesman problem ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Elements of dynamic programming in extremal routing problems ⋮ Problem of successive megalopolis traversal with the precedence conditions ⋮ On one routing task with the optimization of the start-finish point ⋮ A procedure for solution of the problem of optimal covering of a finite set ⋮ On an iterative procedure for solving a routing problem with constraints ⋮ THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION ⋮ To the question of optimization of the starting point in the routing problem with restrictions ⋮ Routing under constraints: problem of visit to megalopolises ⋮ A survey of very large-scale neighborhood search techniques ⋮ Dynamic programming in the routing problem with complex dependence of costs on the list of jobs ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ Dynamic programming method in the generalized courier problem ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions ⋮ On one routing problem modeling movement in radiation fields ⋮ Оptimization of the Start Point in the Gtsp with the Precedence Conditions ⋮ Dynamic programming in the generalized bottleneck problem and the start point optimization ⋮ Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks ⋮ Special cases of the traveling salesman problem
This page was built for publication: The traveling salesman problem. Approximate algorithms
