On an iterative procedure for solving a routing problem with constraints

DOI10.1134/S0081543813090034zbMath1302.90170OpenAlexW2126412505MaRDI QIDQ483197

Yong-Cai Geng, Sumit K. Garg

Publication date: 16 December 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543813090034

zbMATH Keywords

precedence constraintsextremal problemroute

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27) Dynamic programming (90C39) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

Elements of dynamic programming in extremal routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained optimal routing
• Iteration method in a routing problem with internal losses
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Reduction of route optimization problems
• An extremal constrained routing problem with internal losses
• A generalized Courier problem with the cost function depending on the list of tasks
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach

This page was built for publication: On an iterative procedure for solving a routing problem with constraints