Integer quadratic optimization

DOI10.1016/0377-2217(85)90181-XzbMATH Open0553.90070OpenAlexW1972259521MaRDI QIDQ759647FDOQ759647

Authors: 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

Recommendations

• An effective branch-and-bound algorithm for convex quadratic integer programming
• An effective branch-and-bound algorithm for convex quadratic integer programming
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• scientific article; zbMATH DE number 4008100
• Global optimization techniques for solving the general quadratic integer programming problem

zbMATH Keywords

branch and boundlinearly constrained, integer quadratic optimization

Mathematics Subject Classification ID

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

Cites Work

• A General Quadratic Programming Algorithm
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Mixed-integer quadratic programming
• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• Time-slot assignment for TDMA-systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Improving an exact approach for solving separable integer quadratic knapsack problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• Die direkte suche - ein heurlstisches verfahren zur behand-lung ganzzahliger quadratischer optimierungspromeme
• On duality for Boolean programming
• Models and methods of solution of quadratic integer programming problems
• Title not available (Why is that?)
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems

This page was built for publication: Integer quadratic optimization

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