Extremal routing problem with internal losses

DOI10.1134/S0081543809050071zbMath1312.90013MaRDI QIDQ2347522

Yanyan Li

Publication date: 27 May 2015

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

zbMATH Keywords

pathprecedence conditionsroute

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39) Traffic problems in operations research (90B20)

Related Items (5)

Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ Dynamic programming in the routing problem: decomposition variant ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Elements of dynamic programming in extremal routing problems

Cites Work

• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
• Unnamed Item

This page was built for publication: Extremal routing problem with internal losses