Pages that link to "Item:Q3167632"
From MaRDI portal
The following pages link to Aircraft Sequencing Problems via a Rolling Horizon Algorithm (Q3167632):
Displaying 17 items.
- A dynamic programming approach for the aircraft landing problem with aircraft classes (Q319015) (← links)
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035) (← links)
- Improved rolling horizon approaches to the aircraft sequencing problem (Q892901) (← links)
- An optimal data-splitting algorithm for aircraft sequencing on a single runway (Q2070768) (← links)
- A fast exact algorithm for airplane refueling problem (Q2180164) (← links)
- For the airplane refueling problem local precedence implies global precedence (Q2341094) (← links)
- Lessons from building an automated pre-departure sequencer for airports (Q2398434) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- The aircraft runway scheduling problem: a survey (Q2668767) (← links)
- Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
- State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting (Q3195337) (← links)
- Some effects of aircraft arrival sequence algorithms (Q3394084) (← 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)
- Flights assignment model of multiple airports based on game theory and CDM mechanism (Q6534776) (← links)
