Some properties of the fleet assignment problem

DOI10.1016/0167-6377(94)90001-9zbMath0810.90067OpenAlexW1974535936MaRDI QIDQ1332950

Yinhua Wang, Ellis L. Johnson, Zonghao Gu, Nemhauser, George I.

Publication date: 5 September 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90001-9

zbMATH Keywords

NP-completefleet assignmentmulticommodity flow problemtime-space directed network

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (6)

Airline fleet assignment concepts, models, and algorithms ⋮ Airline flight schedule planning under competition ⋮ Solving a large-scale integrated fleet assignment and crew pairing problem ⋮ A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model ⋮ Network flow-based approaches for integrated aircraft fleeting and routing ⋮ From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future

Cites Work

• Unnamed Item
• The fleet assignment problem: Solving a large scale integer program
• Covering Graphs by Simple Circuits
• Covering Graphs by Cycles

This page was built for publication: Some properties of the fleet assignment problem