Pages that link to "Item:Q2630256"
From MaRDI portal
The following pages link to Solving the aircraft landing problem with time discretization approach (Q2630256):
Displaying 12 items.
- A dynamic programming approach for the aircraft landing problem with aircraft classes (Q319015) (← links)
- An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem (Q507977) (← links)
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035) (← links)
- Dynamic scheduling of aircraft landings (Q1698918) (← links)
- Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach (Q2077940) (← links)
- Methods for solving of the aircraft landing problem. II: Approximate solution methods (Q2289042) (← links)
- Methods for solving of the aircraft landing problem. I: Exact solution methods (Q2331478) (← links)
- The aircraft runway scheduling problem: a survey (Q2668767) (← links)
- Weighted constrained position shift model for aircraft arrival sequencing and scheduling problem (Q2821095) (← links)
- A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem (Q6051597) (← links)
- Heuristics for flights arrival scheduling at airports (Q6071058) (← links)
- A MILP formulation and a metaheuristic approach for the scheduling of drone landings and payload changes on an automatic platform (Q6619782) (← links)
