Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820)
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: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price |
scientific article; zbMATH DE number 7024039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price |
scientific article; zbMATH DE number 7024039 |
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
0 references
0 references
0 references
0.8432634472846985
0 references
0.8181784152984619
0 references
0.8173934817314148
0 references
0.8161888718605042
0 references
