A new algorithm for the quasi-assignment problem (Q808992)
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 new algorithm for the quasi-assignment problem |
scientific article; zbMATH DE number 4209905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for the quasi-assignment problem |
scientific article; zbMATH DE number 4209905 |
Statements
A new algorithm for the quasi-assignment problem (English)
0 references
1990
0 references
quasi-assignment problem
0 references
bus scheduling
0 references
tourist guide problem
0 references
successive shortest path algorithm
0 references
0.94229144
0 references
0.94039917
0 references
0.9267551
0 references
0.9263422
0 references
0.92533636
0 references
0.92100704
0 references
0.91782486
0 references
0.91782486
0 references
