On One Routing Problem with Non-Additive Cost Aggregation

DOI10.14529/MMP200105MaRDI QIDQ3387303zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, A. A. Chentsov, A. N. Sesekin

Publication date 12 January 2021

Published in Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingpreceding conditionsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 6025258
• On nonadditive route costs consideration for the traffic equilibrium problem
• One-way and two-way cost allocation in hub network problems
• Routing with nonlinear multiattribute cost functions
• Non-additive shortest path in the context of traffic assignment
• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• An implicit programming approach for the road pricing problem with nonadditive route costs
• A game-theoretic algorithm for non-linear single-path routing problems
• On one routing task with the optimization of the start-finish point
• The Traffic Equilibrium Problem with Nonadditive Path Costs

Cited in

(6)

• Non-additive shortest path in the context of traffic assignment
• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• On sequential traversal of sets
• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• One task of routing jobs in high radiation conditions
• A bottleneck routing problem with a system of priority tasks

This page was built for publication: On One Routing Problem with Non-Additive Cost Aggregation

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