Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results

DOI10.1023/A:1011233219223zbMath1009.90016OpenAlexW2127647529MaRDI QIDQ5942940

Nemhauser, George I., Gregory D. Glockner, Craig A. Tovey

Publication date: 22 April 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011233219223

zbMATH Keywords

Lagrangian decompositionnetwork flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Optimality conditions and duality in mathematical programming (90C46) Deterministic network models in operations research (90B10)

Related Items (2)

Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory

This page was built for publication: Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results