A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Copyright policy )A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
AbstractNetwork flow problems form an important and much‐studied family of combinatorial optimization problems, with a huge array of practical applications. Two network flow problems in particular have received a great deal of attention: the maximum flow and minimum‐cost flow problems. We review the progress that has been made on exact solution algorithms for these two problems, with an emphasis on worst‐case running times.
- Lancaster University United Kingdom
- Universidad Nacional de Costa Rica Costa Rica
- National Autonomous University of Mexico Mexico
Vehicle Routing Problem and Variants, Combinatorial optimization, Minimum-cost flow problem, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, Geometry, Industrial and Manufacturing Engineering, Multi-commodity flow problem, 510, Engineering, network flows, Combinatorial Optimization, FOS: Mathematics, Large-Scale Optimization, Maximum flow problem, Mathematical optimization, Flow network, Programming involving graphs or networks, Computer science, 004, Network Flows, Algorithm, Computational Theory and Mathematics, Computer Science, Physical Sciences, combinatorial optimization, Flows in graphs, Flow (mathematics), Mathematics, Graph Theory and Algorithms
Vehicle Routing Problem and Variants, Combinatorial optimization, Minimum-cost flow problem, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, Geometry, Industrial and Manufacturing Engineering, Multi-commodity flow problem, 510, Engineering, network flows, Combinatorial Optimization, FOS: Mathematics, Large-Scale Optimization, Maximum flow problem, Mathematical optimization, Flow network, Programming involving graphs or networks, Computer science, 004, Network Flows, Algorithm, Computational Theory and Mathematics, Computer Science, Physical Sciences, combinatorial optimization, Flows in graphs, Flow (mathematics), Mathematics, Graph Theory and Algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).20 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!