An algorithm for indefinite integer quadratic programming
From MaRDI portal
Publication:2641219
DOI10.1016/0898-1221(91)90164-YzbMath0721.90056MaRDI QIDQ2641219
Publication date: 1991
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Integer programming (90C10) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
An algorithm for solving a structured class of linear programming problems, A relaxation method for nonconvex quadratically constrained quadratic programs, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Global optimality conditions and optimization methods for quadratic integer programming problems, A polynomial case of convex integer quadratic programming problems with box integer constraints, A discrete dynamic convexized method for nonlinear integer programming, A provable better Branch and Bound method for a nonconvex integer quadratic programming problem, Fractional programming with convex quadratic forms and functions, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints, Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved enumerative algorithm for solving quadratic zero-one programming
- Mixed-integer bilinear programming problems
- The Quadratic Assignment Problem
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Technical Note—Generalized Covering Relaxation for 0-1 Programs
- Quadratic knapsack problems
- Mixed-integer quadratic programming
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- An All-Integer Programming Algorithm with Parabolic Constraints
- An Algorithm for Separable Nonconvex Programming Problems
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Duality in Discrete Programming: II. The Quadratic Case
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
