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):
Displaying 13 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← 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)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← 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)
- Reachability Analysis and Deterministic Global Optimization of DAE Models (Q2795640) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
