Solving large airline crew scheduling problems: Random pairing generation and strong branching (Q5946770): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1023/a:1011223523191 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1521523146 / rank | |||
Normal rank | |||
Latest revision as of 11:55, 30 July 2024
scientific article; zbMATH DE number 1659648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large airline crew scheduling problems: Random pairing generation and strong branching |
scientific article; zbMATH DE number 1659648 |
Statements
Solving large airline crew scheduling problems: Random pairing generation and strong branching (English)
0 references
7 April 2002
0 references
transportation
0 references
branch and bound
0 references
airline crew scheduling
0 references
random pairing
0 references
linear programming relaxation
0 references
integer program
0 references
linear programming based heuristic
0 references
