Integer quadratic optimization

DOI10.1016/0377-2217(85)90181-XzbMath0553.90070OpenAlexW1972259521MaRDI QIDQ759647

Frank Koerner

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90181-x

zbMATH Keywords

branch and boundlinearly constrained, integer quadratic optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20)

Related Items (6)

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems ⋮ Improving an exact approach for solving separable integer quadratic knapsack problems ⋮ A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹ ⋮ Models and methods of solution of quadratic integer programming problems ⋮ On duality for Boolean programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• Time-slot assignment for TDMA-systems
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Mixed-integer quadratic programming
• Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren
• A General Quadratic Programming Algorithm

This page was built for publication: Integer quadratic optimization