A Computational Study of Cost Reoptimization for Min-Cost Flow Problems

DOI10.1287/ijoc.1040.0081zbMath1241.90158OpenAlexW2162039535WikidataQ118165499 ScholiaQ118165499MaRDI QIDQ2892272

Antonio Manca, Antonio Frangioni

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a214f1641ecffd2090a28375aa4d61d55ad78565

zbMATH Keywords

analysis of algorithms computers-computer science software networks-graphs flow algorithms networks-graphs multicommodity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Prim-based support-graph preconditioners for min-cost flow problems, Minimum-cost flow algorithms: an experimental evaluation, The lane covering problem with time windows, A theory and algorithms for combinatorial reoptimization, A least-squares minimum-cost network flow algorithm, Updating network flows given multiple, heterogeneous arc attribute changes, Accelerated multigrid for graph Laplacian operators, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A Computationally Efficient Method for Nonparametric Modeling of Neural Spiking Activity with Point Processes, Experiments with a hybrid interior point/combinatorial approach for network flow problems, MCFClass

Uses Software

• PPRN
• MCF