The traveling salesman problem. I: Theoretical issues
From MaRDI portal
Publication:918426
zbMath0705.90070MaRDI QIDQ918426
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal
Publication date: 1989
Published in: Automation and Remote Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (38)
Route problem with constraints depending on a list of tasks ⋮ Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ On sequential traversal of sets ⋮ Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ 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) ⋮ The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching ⋮ Choosing the sequence of approach of a nonlinear object to a group of moving points ⋮ Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem ⋮ Maximum travelling salesman problem. I ⋮ Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ Minimax routing problem with a system of priority tasks ⋮ On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics ⋮ A bottleneck routing problem with a system of priority tasks ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ The symmetric travelling salesman problem. II: New low bounds ⋮ Nonlinear resolving functions for the travelling salesman problem ⋮ 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 ⋮ On an iterative procedure for solving a routing problem with constraints ⋮ Discrete optimization by optimal control methods. II: The static traveling salesman problem ⋮ To the question of optimization of the starting point in the routing problem with restrictions ⋮ Routing under constraints: problem of visit to megalopolises ⋮ On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs ⋮ 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 ⋮ 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. I: Theoretical issues
