Pages that link to "Item:Q2452383"

The following pages link to Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383):

Displaying 16 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
• A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
• Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
• Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
• Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
• A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
• A partial outer convexification approach to control transmission lines (Q2419514) (← links)
• Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization (Q6114963) (← links)