Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
From MaRDI portal
Publication:3167626
DOI10.1007/978-3-642-32147-4_20zbMath1370.90055OpenAlexW1920813715MaRDI QIDQ3167626
François Clautiaux, Marie-Émilie Voge
Publication date: 2 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_20
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Flows in graphs (05C21)
Related Items (2)
Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
This page was built for publication: Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
