A quasi-assignment algorithm for bus scheduling (Q3792474): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230170302 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230170302 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971732610 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230170302 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:46, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quasi-assignment algorithm for bus scheduling |
scientific article |
Statements
A quasi-assignment algorithm for bus scheduling (English)
0 references
1987
0 references
quasi-assignment algorithm
0 references
bus scheduling
0 references
vehicle routing
0 references
assigning buses
0 references
large number of short trips in an urban area
0 references
bus depot
0 references
transportation problem
0 references
assignment model
0 references
Hungarian method
0 references
Computational results
0 references
