Incremental Network Optimization: Theory and Algorithms

DOI10.1287/opre.1080.0607zbMath1226.90125OpenAlexW1977847591WikidataQ59592341 ScholiaQ59592341MaRDI QIDQ3100369

Onur Şeref, Ravindra K. Ahuja, James B. Orlin

Publication date: 24 November 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1080.0607

zbMATH Keywords

theorydistance algorithmsflow algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

The recoverable robust spanning tree problem with interval costs is polynomially solvable ⋮ The capacity expansion path problem in networks ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Independent set under a change constraint from an initial solution ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ Dominance-based linear formulation for the anchor-robust project scheduling problem ⋮ A modified active set algorithm for transportation discrete network design bi-level problem

This page was built for publication: Incremental Network Optimization: Theory and Algorithms