An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem

DOI10.1007/s40314-014-0195-yzbMath1368.90073OpenAlexW2116028184MaRDI QIDQ2013610

Hui Huang, Ming Liu, Bo Xu, Wei-Min Ma

Publication date: 8 August 2017

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-014-0195-y

zbMATH Keywords

MIPsparse optimizationant colonyaircraft scheduling problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (2)

Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ Traffic flow modeling and optimization control in the approach airspace

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Airport runway scheduling
• Scheduling Aircraft Landings—The Static Case
• Compressed sensing and best 𝑘-term approximation
• Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Shifting Inequality and Recovery of Sparse Signals
• Sparse Approximate Solutions to Linear Systems
• Compressed sensing

This page was built for publication: An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem