A versatile scheme for ranking the extreme points of an assignment polytope (Q3320125)
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: A versatile scheme for ranking the extreme points of an assignment polytope |
scientific article; zbMATH DE number 3850823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A versatile scheme for ranking the extreme points of an assignment polytope |
scientific article; zbMATH DE number 3850823 |
Statements
A versatile scheme for ranking the extreme points of an assignment polytope (English)
0 references
1981
0 references
cutting plane scheme
0 references
implicit enumeration framework
0 references
ranking the extreme points
0 references
linear assignment problems
0 references
Computational experience
0 references
0.7902593612670898
0 references
0.7723521590232849
0 references
0.770399272441864
0 references
0.7593346834182739
0 references
