Pages that link to "Item:Q1668796"

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

Displaying 3 items.

• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← 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)