About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Interpreted as:

title:(Solving AND the AND Airline AND Crew AND Pairing AND Problem AND using AND Subsequence AND Generation)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
1 Conference paper

Solving the Airline Crew Pairing Problem using Subsequence Generation

Good and fast solutions to the airline crew pairing problem are highly interesting for the airline industry, as crew costs are the biggest expenditure after fuel for an airline. The crew pairing problem is typically modelled as a set partitioning problem and solved by column generation. However

Year: 2010

Language: English

inopfdb acgjl hemk
2 Conference paper

Solving the Airline Crew Pairing Problem using Subsequence Generation

Rasmussen, Matias Sevel; Ryan, David; Lusby, Richard Martin; Larsen, Jesper

Proceedings of the 44th Annual Conference of the Operational Research Society of New Zealand — 2009, pp. 169-171

Good and fast solutions to the airline crew pairing problem are highly interesting for the airline industry, as crew costs are the biggest expenditure after fuel for an airline. The crew pairing problem is typically modelled as a set partitioning problem and solved by column generation. However

Year: 2009

Language: English

eokg hp mcjlfb dani
3 Conference paper

Solving the Airline Crew Pairing Problem using Subsequence Generation

Rasmussen, Matias Sevel; Ryan, David M.; Lusby, Richard Martin; Larsen, Jesper

Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling — 2010, pp. 539-541

Good and fast solutions to the airline crew pairing problem are highly interesting for the airline industry, as crew costs are the biggest expenditure after fuel for an airline. The crew pairing problem is typically modelled as a set partitioning problem and solved by column generation. However

Year: 2010

Language: English

bj f ma nipgleckdoh

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user