Pages that link to "Item:Q2861506"
From MaRDI portal
The following pages link to Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem (Q2861506):
Displaying 9 items.
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
