Undercover: a primal MINLP heuristic exploring a largest sub-MIP
DOI10.1007/S10107-013-0635-2zbMATH Open1291.90144OpenAlexW2048251068MaRDI QIDQ2452383FDOQ2452383
Authors: Timo Berthold, Ambros M. Gleixner 
Publication date: 2 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0635-2
Recommendations
- Publication:4886039
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
- A primal-dual algorithm for the minimum partial set multi-cover problem
- A minimax approach to the implicit programming problem
- Minimum non-submodular cover problem with applications
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- A primal-dual approximation algorithm for \textsc{minsat}
nonconvex optimizationmixed-integer nonlinear programminglarge neighborhood searchprimal heuristicmixed-integer quadratically constrained programming
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Extending a CIP framework to solve MIQCPs
- The global solver in the LINDO API
- GLOMIQO: global mixed-integer quadratic optimizer
- SCIP: solving constraint integer programs
- An Automatic Method of Solving Discrete Programming Problems
- Title not available (Why is that?)
- Evaluating Derivatives
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- Local branching
- Conflict analysis in mixed integer programming
- Improving the feasibility pump
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- The feasibility pump
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Heuristics for convex mixed integer nonlinear programs
- On the hardness of approximating minimum vertex cover
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A better approximation ratio for the vertex cover problem
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- MIP: Theory and practice -- closing the gap
- Branching and bounds tighteningtechniques for non-convex MINLP
- Rounding-based heuristics for nonconvex MINLPS
- A recipe for finding good solutions to MINLPs
- RENS. The optimal rounding
- A cutting plane algorithm for solving bilinear programs
- DINS, a MIP Improvement Heuristic
- Reduction of indefinite quadratic programs to bilinear programs
Cited In (18)
- A computational study of primal heuristics inside an MI(NL)P solver
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Computational aspects of infeasibility analysis in mixed integer programming
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Generalized relax-and-fix heuristic
- A feasible rounding approach for mixed-integer optimization problems
- Computing feasible points for binary MINLPs with MPECs
- A partial outer convexification approach to control transmission lines
- Experiments with conflict analysis in mixed integer programming
- A storm of feasibility pumps for nonconvex MINLP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- RENS. The optimal rounding
- Inexact feasibility pump for mixed integer nonlinear programming
- Three ideas for a feasibility pump for nonconvex MINLP
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Granularity in nonlinear mixed-integer optimization
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
Uses Software
This page was built for publication: Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452383)
