The following pages link to RENS. The optimal rounding (Q744216):
Displaying 35 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- A proximal-point outer approximation algorithm (Q2023688) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization (Q6114963) (← links)
- Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)
- Using multiple reference vectors and objective scaling in the feasibility pump (Q6491331) (← links)
- One-shot learning for MIPs with SOS1 constraints (Q6579097) (← links)
