Generating price-effective intermodal routes

DOI10.1111/J.1467-9574.2011.00493.XMaRDI QIDQ6573456zbMATH OpenFDO

Authors Joaquim A. S. Gromicho, Erwin Oudshoorn, Gerhard Post

Publication date 16 July 2024

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/J.1467-9574.2011.00493.X

zbMATH Keywords

schedulingshortest path

Mathematics Subject Classification ID

Graph theory (05Cxx) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Cites work

• A dual algorithm for the constrained shortest path problem
• A Method for the Solution of the N th Best Path Problem
• A new implementation of Yen's ranking loopless paths algorithm
• An algorithm for the resource constrained shortest path problem
• An Appraisal of Some Shortest-Path Algorithms
• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 1670670 (Why is no real title available?)
• Opportunities for OR in intermodal freight transport research: A review.

This page was built for publication: Generating price-effective intermodal routes

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