An efficient branch and bound algorithm to solve the quadratic integer programming problem

DOI10.1007/BF02253896zbMath0494.65035MaRDI QIDQ1169260

S. Singh

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

numerical testsbranch and boundinteger quadratic programming

Mathematics Subject Classification ID

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

Related Items (6)

A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm ⋮ Models and methods of solution of quadratic integer programming problems ⋮ On the relationship between the integer and continuous solutions of convex programs ⋮ An exact penalty function approach for nonlinear integer programming problems ⋮ Linear Reformulations of Integer Quadratic Programs ⋮ Integer quadratic optimization

Cites Work

• Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)
• Discrete optimization
• Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient branch and bound algorithm to solve the quadratic integer programming problem