Pages that link to "Item:Q1668796"

The following pages link to Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796):

Displaying 9 items.

• The cluster problem revisited (Q742132) (← links)
• Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints (Q934175) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• The cluster problem in constrained global optimization (Q1683326) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• Dual bounding procedures lead to convergent branch-and-bound algorithms (Q5955564) (← links)
• Norm-optimal iterative learning control in an integer-valued control domain (Q6040972) (← links)
• New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem (Q6102886) (← links)
• Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)