There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
From MaRDI portal
Publication:5672450
DOI10.1287/opre.21.1.221zbMath0257.90029OpenAlexW2143386234MaRDI QIDQ5672450
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.221
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, Inversion of convection-diffusion equation with discrete sources, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Disjunctive Cuts for Nonconvex MINLP, Scheduling under linear constraints, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Complexity of linear relaxations in integer programming, Complexity of integer quasiconvex polynomial optimization, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, A canonical form for pencils of matrices with applications to asymptotic linear programs, Mixed integer nonlinear programming tools: an updated practical overview, A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems, Mathematical programming: Turing completeness and applications to software analysis, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Optimal Spacing of “Covered” and “Exposed” Time Intervals in a Stochastic Process with High Penalty Costs: Applications to Parking and Insurance, Generating valid linear inequalities for nonlinear programs via sums of squares, On the facet defining inequalities of the mixed-integer bilinear covering set, Optimizing a multi-stage production/inventory system by DC programming based approaches, Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods, An efficient branch and bound algorithm to solve the quadratic integer programming problem, Mixed-integer quadratic programming is in NP, Norm bounds and underestimators for unconstrained polynomial integer minimization, Finding discrete global minima with a filled function for integer programming, An approximate algorithm for nonlinear integer programming, An approximate algorithm for nonlinear integer programming, A new filled function method for nonlinear integer programming problem, Integer programming formulation of combinatorial optimization problems, QPLIB: a library of quadratic programming instances, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Preface, On duality for Boolean programming, Mixed integer nonlinear programming tools: a practical overview
