Consider a complete graph G = (K, E) in which each node is present with probability p,. We are interested in solving combinatorial optimization problems on subsets of nodes which are present with aâ€¦ (More)

This paper presents a new integer programming (IP) model for large-scale instances of the air traffic flow management (ATFM) problem. The model covers all the phases of each flightâ€”i.e., takeoff, enâ€¦ (More)

A heuristic algorithm is described for a time-constrained version of the advance-request, multi-vehicle, many-to-many Dial-A-Ride Problem (DARP). The time constraints consist of upper bounds on: (I)â€¦ (More)

In 1986, the total profits of the U.S. airline industry were of the order of $800 million, while its total delay costs due to congestion approached the figure of $2 billion. Motivated by thisâ€¦ (More)

In this paper, we analyze a generalization of a classic network flow model. The generalization involves the replacement of deterministic demand with stochastic demand. While this generalizationâ€¦ (More)

The yearly congestion costs in the US airline industry are estimated to be of the order of $2 billion. In [6] we have introduced and studied generic integer programming models for the staticâ€¦ (More)

In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases of each flights,â€¦ (More)