Pages that link to "Item:Q1370656"
From MaRDI portal
The following pages link to A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656):
Displaying 5 items.
- A global optimization problem in portfolio selection (Q839845) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- Exact optimal experimental designs with constraints (Q2361462) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
