Iteration method in a routing problem with internal losses

DOI10.1134/S0081543810060064zbMath1231.90083OpenAlexW2054524828MaRDI QIDQ643754

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

zbMATH Keywords

pathprecedence conditionsroute

Mathematics Subject Classification ID

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

Related Items (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