A Semidefinite Relaxation for Air Traffic Flow Scheduling

Details A Semidefinite Relaxation for Air Traffic Flow Scheduling A Semidefinite Relaxation for Air Traffic Flow Scheduling

2006-09-26

arxiv.org/abs/cs/0609145v1

Computer Science

Computational Engineering, Finance, and Science

Submitted to RIVF 2007

Scientific paper

We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation techniques to form a convex relaxation of that problem. Finally, we present a randomization algorithm to further improve the quality of the solution. Because of the specific structure of the air traffic flow problem, the relaxation has a single semidefinite constraint of size dn where d is the maximum delay and n the number of flights.

Affiliated with

Also associated with

No associations

Rating

A Semidefinite Relaxation for Air Traffic Flow Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Semidefinite Relaxation for Air Traffic Flow Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Semidefinite Relaxation for Air Traffic Flow Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260963