Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
From MaRDI portal
Recommendations
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- New convergent heuristics for 0-1 mixed integer programming
- New variable neighborhood search based 0-1 MIP heuristics
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- Mathematical programming based heuristics for the 0--1 MIP: a survey
Cited in
(12)- Variable neighborhood search: basics and variants
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- New convergent heuristics for 0-1 mixed integer programming
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Variable neighborhood search for the pharmacy duty scheduling problem
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- New variable neighborhood search based 0-1 MIP heuristics
- Constraint violation reduction search for 0–1 mixed integer linear programming problems
- Variable neighborhood search: the power of change and simplicity
- Restrict-and-relax search for 0-1 mixed-integer programs
This page was built for publication: Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861506)
