Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs

From MaRDI portal
Publication:2654395

DOI10.1016/j.cor.2009.09.010zbMath1178.90253OpenAlexW2045824363MaRDI QIDQ2654395

Dragan Urošević, Saïd Hanafi, Jasmina Lazić, Nenad Mladenović

Publication date: 15 January 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.010




Related Items (22)

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming FeasibilityA mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problemA heuristic for BILP problems: the single source capacitated facility location problemHeuristic approaches for biobjective mixed 0-1 integer linear programming problemsVariable neighborhood search for the pharmacy duty scheduling problemModel-based automatic neighborhood design by unsupervised learningMIP neighborhood synthesis through semantic feature extraction and automatic algorithm configurationCombining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problemsMathematical programming based heuristics for the 0--1 MIP: a surveyEjection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problemsParallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraintsAdaptive kernel search: a heuristic for solving mixed integer linear programsAssigning Team Tasks and Multiple Activities to Fixed Work ShiftsVariable neighborhood search: the power of change and simplicityVariable neighborhood search: basics and variantsTimetable coordination in a rail transit network with time-dependent passenger demandGeneralized local branching heuristics and the capacitated ring tree problemA novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problemIterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problemRevenue maximization of Internet of things provider using variable neighbourhood searchOn convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programsA variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems


Uses Software


Cites Work


This page was built for publication: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs