The traveling salesman problem. II: Exact methods
From MaRDI portal
Publication:918427
zbMath0705.90071MaRDI QIDQ918427
I. I. Melamed, I. Kh. Sigal, S. I. Sergeev
Publication date: 1989
Published in: Automation and Remote Control (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (34)
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 ⋮ An exact algorithm with linear complexity for a problem of visiting megalopolises ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Dynamic programming method in extremal constrained routing problems ⋮ On the solution of the traveling salesman problem once again ⋮ Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ 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 ⋮ An extremal constrained routing problem with internal losses ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Special cases of the traveling salesman problem
This page was built for publication: The traveling salesman problem. II: Exact methods
