Scaling, proximity, and optimization of integrally convex functions
- 24 January 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 175 (1-2) , 119-154
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- L-CONVEXITY ON GRAPH STRUCTURESJournal of the Operations Research Society of Japan, 2018
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problemDiscrete Optimization, 2015
- Bisubmodular polyhedra, simplicial divisions, and discrete convexityDiscrete Optimization, 2014
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concaveDiscrete Applied Mathematics, 2014
- Nonlinear Integer Programming2009
- Complexity and algorithms for nonlinear optimization problemsAnnals of Operations Research, 2007
- Discrete fixed point theorem reconsideredJournal of Mathematical Economics, 2005
- A capacity scaling algorithm for M-convex submodular flowMathematical Programming, 2004
- Notes on L-/M-convex functions and the separation theoremsMathematical Programming, 2000
- Convex separable optimization is not much harder than linear optimizationJournal of the ACM, 1990