Pages that link to "Item:Q3515505"
From MaRDI portal
The following pages link to VLSN search algorithms for partitioning problems using matching neighbourhoods (Q3515505):
Displaying 7 items.
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
