Pages that link to "Item:Q5178746"
From MaRDI portal
The following pages link to On branching rules for convex mixed-integer nonlinear optimization (Q5178746):
Displaying 8 items.
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)