A set packing model for the ground holding problem in congested networks

DOI10.1016/S0377-2217(00)00064-3zbMath0991.90021MaRDI QIDQ5935422

Fabrizio Rossi, Stefano Smriglio

Publication date: 26 June 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00064-3

zbMATH Keywords

integer programming; stable set; air traffic management; set packing

Mathematics Subject Classification ID

90C10: Integer programming

90B50: Management decision making, including multiple objectives

90B10: Deterministic network models in operations research

90B20: Traffic problems in operations research

Related Items

A hybrid evolutionary approach for set packing problem, A dynamic programming approach for the aircraft landing problem with aircraft classes, Solving the set packing problem via a maximum weighted independent set heuristic, Heuristic algorithms for visiting the customers in a rolling schedule environment, GRASP for set packing problems., A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, Special issue on: Optimization methods for decision making: advances and applications, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Scheduling two chains of unit jobs on one machine: A polyhedral study

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Matching theory
• Geometric algorithms and combinatorial optimization
• Solving the multi-airport Ground Holding Problem
• MINTO, a Mixed INTeger Optimizer
• The application of operational research to European air traffic flow management -- understanding the context
• The Air Traffic Flow Management Problem with Enroute Capacities
• Multiairport Ground Holding Problem: A Computational Evaluation of Exact Algorithms
• The Multiple Connections Multi-Airport Ground Holding Problem: Models and Algorithms
• From Ground Holding to Free Flight: An Exact Approach
• Finding a Maximum Clique in an Arbitrary Graph
• Set Partitioning: A survey
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• The Multi-Airport Ground-Holding Problem in Air Traffic Control
• Dynamic Ground-Holding Policies for a Network of Airports
• A branch-and-cut algorithm for the maximum cardinality stable set problem