On the \(K\) best integer network flows

DOI10.1016/J.COR.2012.08.014zbMath1349.90173OpenAlexW1976399008MaRDI QIDQ340269

Antonio Sedeño-Noda, Juan José Espino-Martín

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.014

zbMATH Keywords

combinatorial optimization\(K\) best integer network flow problemminimum cost flow problem

Mathematics Subject Classification ID

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

Related Items (1)

Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem

This page was built for publication: On the \(K\) best integer network flows