Pages that link to "Item:Q5672450"
From MaRDI portal
The following pages link to There Cannot be any Algorithm for Integer Programming with Quadratic Constraints (Q5672450):
Displaying 33 items.
- Scheduling under linear constraints (Q323163) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- On duality for Boolean programming (Q750292) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
- An efficient branch and bound algorithm to solve the quadratic integer programming problem (Q1169260) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods (Q1719642) (← links)
- A canonical form for pencils of matrices with applications to asymptotic linear programs (Q1908190) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
- A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906559) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
- Preface (Q5970730) (← links)
- Optimal Spacing of “Covered” and “Exposed” Time Intervals in a Stochastic Process with High Penalty Costs: Applications to Parking and Insurance (Q6160128) (← links)