Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements (Q2263199)
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 a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements |
scientific article; zbMATH DE number 6416297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements |
scientific article; zbMATH DE number 6416297 |
Statements
Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements (English)
0 references
18 March 2015
0 references
combinatorial optimization
0 references
arrangements
0 references
branch and bound method
0 references
0.8187447190284729
0 references
0.817546010017395
0 references
0.8015326261520386
0 references
