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

Displayed 6 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)
• 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)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) ‎ (← links)
• Partner selection with a due date constraint in virtual enterprises (Q2493713) ‎ (← links)