Constrained optimal routing

DOI10.1134/S106456240806015XMaRDI QIDQ542269zbMATH OpenFDO

Authors A. G. Chentsov

Publication date 8 June 2011

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

expendituressequentially traversing sets

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Recommendations

• Dynamic programming method in extremal constrained routing problems
• On an iterative procedure for solving a routing problem with constraints
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• A discrete-continuous routing problem with precedence constraints

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• Dynamic Programming Treatment of the Travelling Salesman Problem

Cited in

(8)

• Route problem with constraints depending on a list of tasks
• Iteration method in a routing problem with internal losses
• A discrete-continuous routing problem with precedence constraints
• Constrained traffic equilibrium in routing
• On an iterative procedure for solving a routing problem with constraints
• scientific article; zbMATH DE number 1594568 (Why is no real title available?)
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• Extremal bottleneck routing problem with constraints in the form of precedence conditions

This page was built for publication: Constrained optimal routing

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