Pages that link to "Item:Q1925794"

The following pages link to A storm of feasibility pumps for nonconvex MINLP (Q1925794):

Displaying 30 items.

• Towards an objective feasibility pump for convex minlps (Q263161) (← links)
• 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 recipe for finding good solutions to MINLPs (Q384810) (← links)
• Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• Feasibility pump for aircraft deconfliction with speed regulation (Q721163) (← links)
• Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
• Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
• A proximal-point outer approximation algorithm (Q2023688) (← links)
• A constraints-aware reweighted feasibility pump approach (Q2060346) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
• A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
• Feasibility pump algorithm for sparse representation under Laplacian noise (Q2298553) (← links)
• Ten years of feasibility pump, and counting (Q2329705) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← 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)
• Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
• Improving the Randomization Step in Feasibility Pump (Q4603044) (← links)
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (Q4972550) (← links)
• Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
• The Chebyshev center as an alternative to the analytic center in the feasibility pump (Q6081593) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)