Pages that link to "Item:Q486413"
From MaRDI portal
The following pages link to Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413):
Displaying 7 items.
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Solving mixed integer nonlinear programs by outer approximation (Q1337138) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
