Name
Abstract | ||
|---|---|---|
•We study the crew pairing problem with base constraints.•The new branching heuristic revises poor branching decisions without backtracking.•Four branch-and-price heuristics are compared.•The one with the new branching outperforms the others for constrained scenarios. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.cor.2016.11.020 | Computers & Operations Research |
Keywords | Field | DocType |
Airline crew pairing,Column generation,Branching methods | Column generation,Heuristic,Mathematical optimization,Crew,Crew scheduling,Algorithm,Heuristics,Assignment problem,Backtracking,Mathematics,Search tree | Journal |
Volume | ISSN | Citations |
80 | 0305-0548 | 4 |
PageRank | References | Authors |
0.39 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédéric Quesnel | 1 | 4 | 0.39 |
| Guy Desaulniers | 2 | 874 | 62.90 |
| François Soumis | 3 | 821 | 97.64 |