On the Complexity of Nonlinear Mixed-Integer Optimization
From MaRDI portal
Publication:2897310
DOI10.1007/978-1-4614-1927-3_19zbMath1242.90136arXiv1006.4895OpenAlexW1528002392MaRDI QIDQ2897310
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.4895
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items (12)
Short Presburger Arithmetic Is Hard ⋮ Mixed-Integer Convex Representability ⋮ Optimal dynamic formation control of multi-agent systems in constrained environments ⋮ Knapsack with variable weights satisfying linear constraints ⋮ Scheduling and fixed-parameter tractability ⋮ On the complexity of quasiconvex integer minimization problem ⋮ Complexity of optimizing over the integers ⋮ Optimizing a multi-stage production/inventory system by DC programming based approaches ⋮ Some graph optimization problems with weights satisfying linear constraints ⋮ Related machine scheduling with machine speeds satisfying linear constraints ⋮ Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
This page was built for publication: On the Complexity of Nonlinear Mixed-Integer Optimization
