Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS |
scientific article; zbMATH DE number 7486438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS |
scientific article; zbMATH DE number 7486438 |
Statements
Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (English)
0 references
9 March 2022
0 references
heuristics
0 references
variable neighborhood search
0 references
capacitated dispersion problem
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0.9048028
0 references
0.8988287
0 references
0.8785162
0 references
0.8770132
0 references
0.87662554
0 references
0.8758617
0 references
0.8707825
0 references
