The following pages link to SBB (Q18383):
Displaying 20 items.
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Community structure detection for directed networks through modularity optimisation (Q1736848) (← links)
- Solving large MINLPs on computational grids (Q1863899) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model (Q2302375) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- (Q4464670) (← links)
- High-Performance Prototyping of Decomposition Methods in GAMS (Q4995054) (← links)
