Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem (Q5438151)
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: Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem |
scientific article; zbMATH DE number 5229285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem |
scientific article; zbMATH DE number 5229285 |
Statements
Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem (English)
0 references
22 January 2008
0 references
multicriteria optimization
0 references
planar assignment problem
0 references
asymptotically ideal solution
0 references
approximate algorithms
0 references
computational experiments
0 references
0.968924343585968
0 references
0.862835705280304
0 references
0.8539561033248901
0 references
