DINS, a MIP Improvement Heuristic
From MaRDI portal
Publication:5429276
DOI10.1007/978-3-540-72792-7_24zbMath1136.90419MaRDI QIDQ5429276
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_24
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A framework for solving mixed-integer semidefinite programs, Local branching relaxation heuristics for integer linear programs, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Shift-and-propagate, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A computational study of parametric tabu search for 0-1 mixed integer programs, RENS. The optimal rounding, PAC-Bayesian bounds for sparse regression estimation with exponential weights, Adaptive large neighborhood search for mixed integer programming, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, Structure-driven fix-and-propagate heuristics for mixed integer programming, Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Uses Software
