An exact algorithm for multiple depot bus scheduling (Q1319568): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90334-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077123111 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Balanced matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On some matching problems arising in vehicle scheduling models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition Principle for Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133404 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A quasi-assignment algorithm for bus scheduling / rank | |||
Normal rank | |||
Latest revision as of 14:38, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for multiple depot bus scheduling |
scientific article |
Statements
An exact algorithm for multiple depot bus scheduling (English)
0 references
12 April 1994
0 references
