Pages that link to "Item:Q2576448"
From MaRDI portal
The following pages link to Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448):
Displayed 7 items.
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- Portfolio optimization for wealth-dependent risk preferences (Q1958620) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)