Matchings in connection with ground delay program planning

DOI10.1002/net.20272zbMath1167.90501OpenAlexW4230640736MaRDI QIDQ5191150

No author found.

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

matchingmajorizationground delay programs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Incentives in landing slot problems, Inequity averse optimization in operational research

Cites Work

• Unnamed Item
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• Optimization and mediated bartering models for ground delay programs
• Transversals and matroid partition
• Maximum matching in a convex bipartite graph
• Matroids and the greedy algorithm
• Inequalities: theory of majorization and its applications