RENS. The optimal rounding
From MaRDI portal
Publication:744216
DOI10.1007/s12532-013-0060-9zbMath1304.90147OpenAlexW2041252457MaRDI QIDQ744216
Publication date: 6 October 2014
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-013-0060-9
mixed integer programmingmixed integer nonlinear programminglarge neighborhood searchroundingprimal heuristic
Mixed integer programming (90C11) Nonlinear programming (90C30) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Three ideas for a feasibility pump for nonconvex MINLP, A supervised learning-driven heuristic for solving the facility location and production planning problem, Adaptive large neighborhood search for mixed integer programming, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines, An overview of MINLP algorithms and their implementation in Muriqui optimizer, A feasible rounding approach for mixed-integer optimization problems, Local branching relaxation heuristics for integer linear programs, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization, Feasibility jump: an LP-free Lagrangian MIP heuristic, Multidimensional sum-up rounding for integer programming in optimal experimental design, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A framework for solving mixed-integer semidefinite programs, Generalized local branching heuristics and the capacitated ring tree problem, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, 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, A proximal-point outer approximation algorithm, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Structure-driven fix-and-propagate heuristics for mixed integer programming, Restrict-and-relax search for 0-1 mixed-integer programs, Granularity in nonlinear mixed-integer optimization, Conflict-Driven Heuristics for Mixed Integer Programming, Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A recipe for finding good solutions to MINLPs
- Heuristics for convex mixed integer nonlinear programs
- ZI round, a MIP rounding heuristic
- SCIP: solving constraint integer programs
- Mixed integer nonlinear programming tools: a practical overview
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local branching
- Solving zero-one mixed integer programming problems using tabu search
- Rounding-based heuristics for nonconvex MINLPS
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A storm of feasibility pumps for nonconvex MINLP
- Analyzing the computational impact of MIQCP solver components
- Pivot and shift -- a mixed integer programming heuristic
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Measuring the impact of primal heuristics
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The feasibility pump
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Extending a CIP Framework to Solve MIQCPs
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Rapid Learning for Binary Programs
- Octane: A New Heuristic for Pure 0–1 Programs
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Heuristics of the Branch-Cut-and-Price-Framework SCIP
- DINS, a MIP Improvement Heuristic
