Matchings in connection with ground delay program planning

DOI10.1002/NET.20272MaRDI QIDQ5191150zbMATH OpenOpenAlexFDO

Authors

Publication date 28 July 2009

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20272

zbMATH Keywords

ground delay programsmajorizationmatching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the Airline Schedule Perturbation Problem Caused by the Ground Delay Program
• Dynamic Ground-Holding Policies for a Network of Airports
• Propagated delay estimation and its use in the development of an effective aircraft ground delay strategy
• Solving the multi-airport Ground Holding Problem
• scientific article; zbMATH DE number 5370537

Cites work

• A linear time algorithm for maximum matchings in convex, bipartite graphs
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• Matroids and the greedy algorithm
• Maximum matching in a convex bipartite graph
• Optimization and mediated bartering models for ground delay programs
• Transversals and matroid partition

Cited in

(4)

• Incentives in landing slot problems
• Inequity averse optimization in operational research
• Optimization and mediated bartering models for ground delay programs
• Propagated delay estimation and its use in the development of an effective aircraft ground delay strategy

This page was built for publication: Matchings in connection with ground delay program planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191150)