Pages that link to "Item:Q2576448"

The following pages link to Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448):

Displayed 3 items.

• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) ‎ (← links)
• Portfolio optimization for wealth-dependent risk preferences (Q1958620) ‎ (← links)
• Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) ‎ (← links)