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