Routing of displacements with dynamic constraints: “bottleneck problem”

DOI10.20537/VM160110zbMATH Open1398.90133OpenAlexW2478502715MaRDI QIDQ5266472FDOQ5266472

A. G. Chentsov, A. A. Chentsov

Publication date: 6 June 2017

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vuu523

zbMATH Keywords

dynamic programmingtraceroutepreceding conditions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (8)

• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• A discrete-continuous routing problem with precedence constraints
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• A bottleneck routing problem with a system of priority tasks
• Problem of optimal choice of a route under conditions of time discounting
• The dynamic bowser routing problem
• On the question of the optimization of permutations in the problem with dynamic constraints

This page was built for publication: Routing of displacements with dynamic constraints: “bottleneck problem”

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