On the K best integer network flows

DOI10.1016/J.COR.2012.08.014zbMATH Open1349.90173OpenAlexW1976399008MaRDI QIDQ340269FDOQ340269

Authors: 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

Recommendations

• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• A note on \(K\) best network flows
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• scientific article; zbMATH DE number 3906193
• scientific article; zbMATH DE number 3848942

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)

Cited In (7)

• Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• Title not available (Why is that?)
• A note on \(K\) best network flows
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

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

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