Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A heuristic algorithm to minimize the number of crews allocated in an airlift operation

From MaRDI portal
Publication:584060
Jump to:navigation, search

DOI10.1016/0305-0548(90)90017-2zbMath0692.90045OpenAlexW2026200875MaRDI QIDQ584060

M. Jeya Chandra, Jae-Dong Hong

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90017-2


zbMATH Keywords

heuristiclogisticsairlift operationminimal number of crews


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)





Cites Work

  • The analysis of a single base in an airlift operation
  • The assignment of minimum crews among bases in an airlift operation




This page was built for publication: A heuristic algorithm to minimize the number of crews allocated in an airlift operation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:584060&oldid=12477936"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 07:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki