A new algorithm for the quasi-assignment problem (Q808992): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Augmented Threaded Index Method For Network Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A quasi-assignment algorithm for bus scheduling / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02216824 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969435668 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the quasi-assignment problem |
scientific article |
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
