Pages that link to "Item:Q2506191"
From MaRDI portal
The following pages link to Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191):
Displaying 10 items.
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
- Route optimization for multiple searchers (Q3065632) (← links)
- A flexible platform for mixed‐integer non‐linear programming problems (Q3579678) (← links)
- Concurrent processing of mixed‐integer non‐linear programming problems (Q4932950) (← links)