There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

DOI10.1287/OPRE.21.1.221MaRDI QIDQ5672450zbMATH OpenOpenAlexFDO

Authors Robert G. Jeroslow

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

Mathematics Subject Classification ID

Quadratic programming (90C20) Integer programming (90C10)

Cited in

(36)

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

This page was built for publication: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672450)