Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455)
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 maximum min-sum dispersion by alternating formulations of two different problems |
scientific article; zbMATH DE number 6875782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximum min-sum dispersion by alternating formulations of two different problems |
scientific article; zbMATH DE number 6875782 |
Statements
Solving the maximum min-sum dispersion by alternating formulations of two different problems (English)
0 references
29 May 2018
0 references
metaheuristics
0 references
dispersion problems
0 references
binary quadratic programing
0 references
variable neighborhood search
0 references
variable formulation search
0 references
0 references
0 references
0.8026086688041687
0 references
0.7935487031936646
0 references
0.7872357964515686
0 references
0.7855177521705627
0 references
0.7854247093200684
0 references
