LP formulations of the shortest path tree problem

DOI10.1007/S10288-004-0048-4MaRDI QIDQ1775288zbMATH OpenOpenAlexFDO

Authors Jakob Krarup, Malene Nordlund Rørbech

Publication date 6 May 2005

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-004-0048-4

zbMATH Keywords

linear programmingShortest pathsvisualizing LP-duality

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• An auction-based approach for the re-optimization shortest path tree problem
• scientific article; zbMATH DE number 2096648
• Dual algorithms for the shortest path tree problem
• A new algorithm for reoptimizing shortest paths when the arc costs change
• A reoptimization algorithm for the shortest path problem with time windows

Cited in

(6)

• Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
• New inequalities for network distance measures by using graph spectra
• Logic-based Benders decomposition for wildfire suppression
• On conjectures of network distance measures by using graph spectra
• An auction-based approach for the re-optimization shortest path tree problem
• scientific article; zbMATH DE number 4173002 (Why is no real title available?)

This page was built for publication: LP formulations of the shortest path tree problem

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