A cost-scaling algorithm for 0–1 submodular flows
Authors:
- 1 March 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 73 (3) , 261-273
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- New scaling algorithms for the assignment and minimum mean cycle problemsMathematical Programming, 1992
- A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functionsMathematical Programming, 1992
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Generalized polymatroids and submodular flowsMathematical Programming, 1988
- Finding feasible vectors of Edmonds-Giles polyhedraJournal of Combinatorial Theory, Series B, 1984
- Minimization on submodular flowsDiscrete Applied Mathematics, 1982