Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370)
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: Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems |
scientific article; zbMATH DE number 1374408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems |
scientific article; zbMATH DE number 1374408 |
Statements
Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (English)
0 references
6 December 1999
0 references
selection equations
0 references
penalty methods
0 references
\({\mathcal N} {\mathcal P}\)-hard
0 references
three-dimensional assignment problem
0 references
combinatorial optimization
0 references
0.9351601
0 references
0.86363935
0 references
0.85812926
0 references
0.85355943
0 references
0.8533189
0 references
0.8527644
0 references
0.8508024
0 references
