Pages that link to "Item:Q3461341"
From MaRDI portal
The following pages link to A new branch and bound method for integer quadratic programming problems (Q3461341):
Displaying 11 items.
- Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
- A new bounding technique in branch-and-bound algorithms for mixed integer programming (Q1384440) (← links)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
- A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
- A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
- Branch and cut method for solving integer indefinite quadratic bilevel programs (Q2675637) (← links)
- A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems (Q2886654) (← links)
- A new branch and bound algorithm for integer quadratic programming problems (Q3457925) (← links)
- (Q4996611) (← links)