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
Discussion
View source
View history
Purge
English
Log in

New heuristics for over-constrained flight to gate assignments

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

DOI10.1057/palgrave.jors.2601736zbMath1095.90067OpenAlexW2036455189MaRDI QIDQ4661203

No author found.

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601736


zbMATH Keywords

heuristicstabu searchair transport


Mathematics Subject Classification ID

Quadratic programming (90C20) Discrete location and assignment (90B80)


Related Items (7)

Flight gate assignment and recovery strategies with stochastic arrival and departure times ⋮ A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints ⋮ Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints ⋮ Truck dock assignment problem with operational time constraint within crossdocks ⋮ Flight gate scheduling with respect to a reference schedule ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ Airport gate scheduling with time windows







This page was built for publication: New heuristics for over-constrained flight to gate assignments

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4661203&oldid=18868416"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 17:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki