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