On the Complexity of Nonlinear Mixed-Integer Optimization
- 15 November 2011
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- A polynomial oracle-time algorithm for convex integer minimizationMathematical Programming, 2009
- Convex Discrete OptimizationPublished by Springer Science and Business Media LLC ,2008
- The complexity of optimizing over a simplex, hypercube or sphere: a short surveyCentral European Journal of Operations Research, 2007
- A faster strongly polynomial time algorithm for submodular function minimizationMathematical Programming, 2007
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimensionMathematical Programming, 2007
- Complexity and algorithms for nonlinear optimization problemsAnnals of Operations Research, 2007
- On integer points in polyhedraCombinatorica, 1992
- Proof of Recursive Unsolvability of Hilbert's Tenth ProblemThe American Mathematical Monthly, 1991
- On the complexity of models of arithmeticThe Journal of Symbolic Logic, 1982
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965