Pages that link to "Item:Q1765223"

The following pages link to A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223):

Displaying 13 items.

• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
• Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
• Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
• Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
• An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
• A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• Partner selection with a due date constraint in virtual enterprises (Q2493713) (← links)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← 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)
• A new branch and bound method for integer quadratic programming problems (Q3461341) (← links)