On a bottleneck routing problem

DOI10.1134/S0081543811020131zbMath1247.90067MaRDI QIDQ643816

Juan-Miguel Gracia

Publication date: 2 November 2011

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

zbMATH Keywords

routingprecedence conditions

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (4)

Elements of dynamic programming in extremal routing problems ⋮ Approximation schemes for the generalized traveling salesman problem ⋮ Dynamic programming in the routing problem with complex dependence of costs on the list of jobs ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Cites Work

• Unnamed Item

This page was built for publication: On a bottleneck routing problem