Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEMON / rank | |||
Normal rank | |||
Revision as of 21:37, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price |
scientific article |
Statements
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (English)
0 references
15 February 2019
0 references
vehicle and crew scheduling
0 references
branch-and-price
0 references
exact methods
0 references
integer programming
0 references
