Iteration method in a routing problem with internal losses

DOI10.1134/S0081543810060064zbMATH Open1231.90083OpenAlexW2054524828MaRDI QIDQ643754FDOQ643754

Juan-Miguel Gracia

Publication date: 2 November 2011

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

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

Recommendations

• The iterations method in generalized courier problem with singularity in the definition of cost functions
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• On an iterative procedure for solving a routing problem with constraints
• Constrained optimal routing
• An extremal constrained routing problem with internal losses

zbMATH Keywords

pathprecedence conditionsroute

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• On an iterative procedure for solving a routing problem with constraints

This page was built for publication: Iteration method in a routing problem with internal losses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643754)