A polynomial combinatorial algorithm for generalized minimum cost flow

Mathematics of Operations Research

Volumn 27, Issue 3, 2002, Pages 445-459

  Wayne, Kevin D ^a  

^a Princeton University   (United States)

Author keywords

Gain factor; Generalized minimum cost flow; Minimum cost flow; Polynomial combinatorial algorithm; Strongly polynomial approximation scheme

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

COST FLOW PROBLEMS; POLYNOMIAL COMBINATORIAL ALGORITHMS;

LINEAR PROGRAMMING;

EID: 0036671133     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.3.445.313     Document Type: Article

References (42)

1. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
2. Note on Weintraub's minimum-cost circulation algorithm
3. Improved algorithms for linear inequalities with two variables per inequality
4. New algorithms for generalized network flows
5. Theoretical improvements in algorithmic efficiency for network flow problems
6. Fast and simple approximation schemes for generalized flow
7. Generalized networks: A fundamental computer-based planning tool
8. Netform modeling and applications
9. Combinatorial algorithms for the generalized circulation problem
10. Beyond the flow decomposition barrier
11. Finding minimum-cost circulations by canceling negative cycles
12. A faster combinatorial algorithm for the generalized circulation problem
13. Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem
14. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
15. Simple and fast algorithms for linear and integer programs with two variables per inequality
16. Optimal flow through networks with gains
17. Mathematical methods of organizing and planning production
18. A new polynomial-time algorithm for linear programming
19. Polynomial algorithms in linear programming
20. A primal method for minimal cost flows with applications to the assignment and transportation problems
21. Minimum ratio canceling is polynomial for linear programming, but not strongly polynomial, even for networks
22. Combinatorial optimization with rational objective functions
23. Applying parallel computation algorithms in the design of serial algorithms
24. Toward a genuinely polynomial algorithm for linear programming
25. Combinatorial approximation algorithms for generalized flow problems
26. Faster algorithms for the generalized network flow problem
27. An oracle-polynomial time augmentation algorithm for integer programming
28. Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
29. Deciding linear inequalities by computing loop residues
30. Simple generalized maximum flow algorithms
31. Speeding up linear programming using fast matrix multiplication
32. A polynomial cycle canceling algorithm for submodular flows
33. A primal algorithm to solve network flow problems with convex costs