RENS. The optimal rounding
From MaRDI portal
Publication:744216
DOI10.1007/S12532-013-0060-9zbMATH Open1304.90147OpenAlexW2041252457MaRDI QIDQ744216FDOQ744216
Authors: Timo Berthold 
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
Recommendations
mixed integer nonlinear programmingmixed integer programmingroundinglarge neighborhood searchprimal heuristic
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Analyzing the computational impact of MIQCP solver components
- 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
- Title not available (Why is that?)
- Heuristics of the branch-cut-and-price-framework SCIP
- SCIP: solving constraint integer programs
- Octane: A New Heuristic for Pure 0–1 Programs
- An Automatic Method of Solving Discrete Programming Problems
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- Local branching
- A storm of feasibility pumps for nonconvex MINLP
- Measuring the impact of primal heuristics
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Heuristics for convex mixed integer nonlinear programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighborhood search and local branching
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- MIP: Theory and practice -- closing the gap
- An evolutionary algorithm for polishing mixed integer programming solutions
- Branching and bounds tighteningtechniques for non-convex MINLP
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Rounding-based heuristics for nonconvex MINLPS
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- A recipe for finding good solutions to MINLPs
- Solving zero-one mixed integer programming problems using tabu search
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- ZI round, a MIP rounding heuristic
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Pivot and shift -- a mixed integer programming heuristic
- Rapid learning for binary programs
- DINS, a MIP Improvement Heuristic
- Mixed integer nonlinear programming tools: a practical overview
Cited In (36)
- A framework for solving mixed-integer semidefinite programs
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- 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
- Generalized relax-and-fix heuristic
- One-shot learning for MIPs with SOS1 constraints
- A feasible rounding approach for mixed-integer optimization problems
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Conflict-Driven Heuristics for Mixed Integer Programming
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- A proximal-point outer approximation algorithm
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Recursive central rounding for mixed integer programs
- Adaptive large neighborhood search for mixed integer programming
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Restrict-and-relax search for 0-1 mixed-integer programs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
- ZI round, a MIP rounding heuristic
- Three ideas for a feasibility pump for nonconvex MINLP
- Using multiple reference vectors and objective scaling in the feasibility pump
- Local branching relaxation heuristics for integer linear programs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- When is rounding allowed in integer nonlinear optimization?
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Generalized local branching heuristics and the capacitated ring tree problem
- Rounding-based heuristics for nonconvex MINLPS
- Granularity in nonlinear mixed-integer optimization
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Uses Software
This page was built for publication: RENS. The optimal rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744216)
