LP formulations of the shortest path tree problem

DOI10.1007/s10288-004-0048-4zbMath1112.90048OpenAlexW2003809182MaRDI QIDQ1775288

Malene Nordlund Rørbech, Jakob Krarup

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

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

Related Items (4)

New inequalities for network distance measures by using graph spectra ⋮ Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ On conjectures of network distance measures by using graph spectra

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