An approach to the subproblem of the cutting angle method of global optimization (Q813345)
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: An approach to the subproblem of the cutting angle method of global optimization |
scientific article; zbMATH DE number 5005148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach to the subproblem of the cutting angle method of global optimization |
scientific article; zbMATH DE number 5005148 |
Statements
An approach to the subproblem of the cutting angle method of global optimization (English)
0 references
8 February 2006
0 references
assignment problem
0 references
cutting angle method
0 references
dominant subset with minimal weight problem
0 references
global optimization problem
0 references
heuristic algorithm
0 references
knapsack problem
0 references
NP-complete
0 references
0 references
0.9674898
0 references
0.9406295
0 references
0.9254753
0 references
0.91666293
0 references
0.90979326
0 references
0.8927556
0 references
0.87989277
0 references
0.87875706
0 references
0.86831146
0 references
