Pages that link to "Item:Q2654395"
From MaRDI portal
The following pages link to Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395):
Displaying 11 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
