A Semidefinite Relaxation for Air Traffic Flow Scheduling

Simple item page
dc.creatord'Aspremont, Alexandre
dc.creatorGhaoui, Laurent El
dc.date2006-09-26
dc.date.accessioned2026-07-07T07:23:58Z
dc.date.available2026-07-07T07:23:58Z
dc.descriptionWe 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.
dc.descriptionSubmitted to RIVF 2007
dc.identifierhttps://arxiv.org/abs/cs/0609145
dc.identifierhttp://arxiv.org/abs/cs/0609145
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116179
dc.subjectComputational Engineering, Finance, and Science
dc.titleA Semidefinite Relaxation for Air Traffic Flow Scheduling
dc.typetext

Files

Collections

arXiv