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
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (22)
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility ⋮ A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem ⋮ A heuristic for BILP problems: the single source capacitated facility location problem ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Model-based automatic neighborhood design by unsupervised learning ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ Assigning Team Tasks and Multiple Activities to Fixed Work Shifts ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Revenue maximization of Internet of things provider using variable neighbourhood search ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Zero-one programming with many variables and few constraints
- Variable neighborhood search
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighborhood decomposition search
- New convergent heuristics for 0-1 mixed integer programming
- Variable neighborhood search and local branching
- Multiple Comparisons Among Means
- Approximations of the critical region of the fbietkan statistic
- Integrating heuristic information into exact methods: The case of the vertex p-centre problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
