A branch and cut heuristic for a runway scheduling problem

DOI10.1134/S0005117916110084zbMath1357.90060OpenAlexW2557163463MaRDI QIDQ510289

Maurizio Boccia, Igor' Leonidovich Vasilyev, Pasquale Avella

Publication date: 17 February 2017

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117916110084

zbMATH Keywords

branch and cutrunway scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• Aircraft landing problems with aircraft classes
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
• A computational study of a cutting plane algorithm for university course timetabling
• Improved rolling horizon approaches to the aircraft sequencing problem
• Computational experience with general cutting planes for the set covering problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• Polyhedral study of simple plant location problem with order
• On a continuous approach for the maximum weighted clique problem
• Airport runway scheduling
• A branch-and-cut algorithm for the median-path problem
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
• An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
• Aircraft Sequencing Problems via a Rolling Horizon Algorithm
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
• Integer Programming
• State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting
• On the facial structure of set packing polyhedra

This page was built for publication: A branch and cut heuristic for a runway scheduling problem