Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models

DOI10.1007/978-3-642-32147-4_20MaRDI QIDQ3167626zbMATH OpenOpenAlexFDO

Authors Marie-Émilie Voge, François Clautiaux

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

Mathematics Subject Classification ID

Flows in graphs (05C21) Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• A note on stable flow-equivalent aggregation in closed networks
• On the computational behavior of a polynomial-time network flow algorithm
• Flows in dynamic networks with aggregate arc capacities
• Asymptotic behavior of flows in networks
• Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
• Decomposition and aggregation in queueing networks
• Probabilistic Analysis of Network Flow Algorithms
• Network aggregation and flows with applications to evacuation planning

Cited in

(5)

• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Polymatroidal flow network models with multiple sinks
• Construction of aggregation paradoxes through load-sharing models
• Location of fueling stations and routing of zero-emission well-boats in the Norwegian aquaculture industry

This page was built for publication: Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models

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