Pages that link to "Item:Q384810"
From MaRDI portal
The following pages link to A recipe for finding good solutions to MINLPs (Q384810):
Displaying 11 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions (Q1711419) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
