Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652793 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
This work deals with the proposal of some optimization models for airports check-in services. The aim is to decide the optimal number of check-in gates to open for departing flights, in such a way to balance the operative costs of the service and the passenger waiting time at the terminal. We propose new models for this problem, which presents strong similarities with some well known combinatorial optimization models. We show the complexity of the models and computational results based on a real case study.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics