Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jens Starke / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael Schanz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Hermann Haken / rank | |||
Normal rank | |||
Revision as of 07:51, 10 February 2024
scientific article
| 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 |
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
