New variable neighbourhood search based 0-1 MIP heuristics

DOI10.2298/YJOR140219014HzbMath1474.90301WikidataQ59389581 ScholiaQ59389581MaRDI QIDQ5278851

Jasmina Lazić, Christophe Wilbaut, Saïd Hanafi, Nenad Mladenović, Igor Crévits

Publication date: 19 July 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

convergencevariable neighborhood searchmatheuristics0-1 mixed integer programmingpseudo-cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Nested general variable neighborhood search for the periodic maintenance problem ⋮ Variable neighborhood search variants for min-power symmetric connectivity problem ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Exponential quality function for community detection in complex networks ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ A new variable neighborhood search approach for solving dynamic memory allocation problem ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes

This page was built for publication: New variable neighbourhood search based 0-1 MIP heuristics