Design of one class of transportation networks by dynamic programming

zbMATH Open0691.90092MaRDI QIDQ583128FDOQ583128

Authors: D. T. Lotarev 

Publication date: 1989

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4027150
• scientific article; zbMATH DE number 3972590
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Constructing maximal dynamic flows from static flows
• Network design problem with congestion effects: A case of bilevel programming

zbMATH Keywords

branch-and-bounddesign of a transportation network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Integer programming (90C10)

Cited In (6)

• Optimal network design for an on-demand transport system
• Model for microcirculation transportation network design
• Network design problem with congestion effects: A case of bilevel programming
• Network design and flow problems with cross-arc costs
• The Modulo Network Simplex with Integrated Passenger Routing
• Distribution of transportation networks over a heterogeneous territory

This page was built for publication: Design of one class of transportation networks by dynamic programming

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