An algorithm for indefinite integer quadratic programming
From MaRDI portal
Publication:2641219
A branch and bound method is presented for solving an indefinite integer quadratic programming problem with constraints of the form \(g_ i(x)\leq 0\), \(L_ j\leq x_ j\leq U_ j\), where the \(g_ i\) are real-valued convex functions and \(L_ j\) and \(U_ j\) are real numbers. The method is illustrated by a small example. Computational results are not presented.
Recommendations
- An algorithm for indefinite quadratic programming with convex constraints
- Global minimization of indefinite quadratic problems
- A new branch and bound algorithm for indefinite integer quadratic programs
- A new branch-and-bound algorithm for indefinite quadratic programming problems
- A computational comparison of some branch and bound methods for indefinite quadratic programs
Cites work
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems
- An All-Integer Programming Algorithm with Parabolic Constraints
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An improved enumerative algorithm for solving quadratic zero-one programming
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Duality in Discrete Programming: II. The Quadratic Case
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- scientific article; zbMATH DE number 3353076 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3422199 (Why is no real title available?)
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Mixed-integer bilinear programming problems
- Mixed-integer quadratic programming
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic knapsack problems
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Technical Note—Generalized Covering Relaxation for 0-1 Programs
- The quadratic assignment problem
Cited in
(19)- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- An algorithm for solving a structured class of linear programming problems
- An algorithm for indefinite quadratic programming with convex constraints
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Indefinite quadratic integer bilevel programming problem with bounded variables
- Fractional programming with convex quadratic forms and functions
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- A new branch and bound algorithm for indefinite integer quadratic programs
- scientific article; zbMATH DE number 6007926 (Why is no real title available?)
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Global optimality conditions and optimization methods for quadratic integer programming problems
- An algorithm to solve multi-objective integer quadratic programming problem
- Linear fractional optimization for integer indefinite quadratic fractional problem
- Efficient local and tabu search strategies for large-scale general quadratic integer programming
- A discrete dynamic convexized method for nonlinear integer programming
This page was built for publication: An algorithm for indefinite integer quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641219)
