Pages that link to "Item:Q1762458"

The following pages link to Rounding-based heuristics for nonconvex MINLPS (Q1762458):

Displaying 20 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• Water distribution networks design under uncertainty (Q526639) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
• Guided dive for the spatial branch-and-bound (Q1675571) (← 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)
• Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
• A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
• Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
• Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
• A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
• A partial outer convexification approach to control transmission lines (Q2419514) (← links)
• Measuring the impact of primal heuristics (Q2450740) (← links)
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)