Pages that link to "Item:Q5955564"

The following pages link to Dual bounding procedures lead to convergent branch-and-bound algorithms (Q5955564):

Displaying 8 items.

• Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
• Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
• Global optimization of disjunctive programs (Q1679482) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• On a decomposition method for nonconvex global optimization (Q2463828) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)