Equivalence of convex minimization problems over base polytopes
- 3 July 2012
- journal article
- research article
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 29 (3) , 519-534
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A strongly polynomial algorithm for line search in submodular polyhedraDiscrete Optimization, 2007
- A faster strongly polynomial time algorithm for submodular function minimizationMathematical Programming, 2007
- A push-relabel framework for submodular function minimization and applications to parametric optimizationDiscrete Applied Mathematics, 2003
- A combinatorial strongly polynomial algorithm for minimizing submodular functionsJournal of the ACM, 2001
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- Two algorithms for maximizing a separable concave function over a polymatroid feasible regionEuropean Journal of Operational Research, 1991
- The egalitarian solution and reduced game properties in convex gamesInternational Journal of Game Theory, 1990
- A Concept of Egalitarianism Under Participation ConstraintsEconometrica, 1989
- Submodular systems and related topics1984
- Submodular functions and convexity1983