Cost projection methods for the shortest path problem with crossing costs

DOI10.4230/OASICS.ATMOS.2017.15zbMATH Open1548.9006MaRDI QIDQ6571023FDOQ6571023

Authors: Marco Blanco, Ralf Borndörfer, Hoang Nam-Dung, Anton Kaier, Pedro Maristany de las Casas, Thomas Schlechte, Swen Schlobach 

Publication date: 11 July 2024

Recommendations

• Minimum cost noncrossing flow problem on layered networks
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• scientific article; zbMATH DE number 1488066
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• The fixed-charge shortest-path problem

zbMATH Keywords

shortest path problemresource constrained shortest pathflight trajectory optimizationcost projectioncrossing costsoverflight fees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Cost projection methods for the shortest path problem with crossing costs

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