Solving Airline Crew Scheduling Problems by Branch-and-Cut
From MaRDI portal
Publication:4274629
DOI10.1287/mnsc.39.6.657zbMath0783.90051OpenAlexW2170021258MaRDI QIDQ4274629
Manfred W. Padberg, Karla L. Hoffman
Publication date: 17 March 1994
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.39.6.657
heuristicscrew schedulingpreprocessingpolyhedral cutsbranch-and-cut approachautomatic reformulationlarge set partitioning problems
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Boolean programming (90C09)
Related Items
\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases, Integer programming techniques for the nurse rostering problem, Production systems with limited repair capacity, Subadditive approaches in integer programming, Distributed integral column generation for set partitioning problems, The matching relaxation for a class of generalized set partitioning problems, Linear temporal logic vehicle routing with applications to multi-UAV mission planning, Design rules for application specific dynamical systems, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Computational study of large-scale \(p\)-median problems, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, Application of a hybrid genetic algorithm to airline crew scheduling, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Strong lift-and-project cutting planes for the stable set problem, Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint, A computational study of a cutting plane algorithm for university course timetabling, Duty-period-based network model for crew rescheduling in European airlines, Cover by disjoint cliques cuts for the knapsack problem with conflicting items, Some thoughts on combinatorial optimisation, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, A note on branch-and-cut-and-price, Solving a multi-objective interval crew-scheduling problem via genetic algorithms, Enhancing CLP branch and bound techniques for scheduling problems, An intelligent system for US Coast Guard cutter scheduling, Use of hidden network structure in the set partitioning problem, An extended formulation for the 1‐wheel inequalities of the stable set polytope, A three-phase heuristic for the fairness-oriented crew rostering problem, Customizing the solution process of COIN-OR's linear solvers with python, Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, A dynamic programming based algorithm for the crew scheduling problem., Modeling and solving a crew assignment problem in air transportation, Staff scheduling and rostering: a review of applications, methods and models., Pricing combinatorial auctions., Measuring the impact of primal heuristics, Conflict graphs in solving integer programming problems, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, A new modeling and solution approach for the set-partitioning problem, Learning in Combinatorial Optimization: What and How to Explore, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, A relax-and-cut algorithm for the set partitioning problem, Classical cuts for mixed-integer programming and branch-and-cut, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Column generation in the integral simplex method, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Metaheuristics approach to the aircrew rostering problem, Effective search space control for large and/or complex driver scheduling problems, Interval propagation to reason about sets: Definition and implementation of a practical language, On the mixed set covering, packing and partitioning polytope, A dual ascent procedure for the set partitioning problem, An integer programming approach to generating airline crew pairings, Modelling transfer line design problem via a set partitioning problem, Searching for optimal integer solutions to set partitioning problems using column generation, Multi-phase dynamic constraint aggregation for set partitioning type problems, Cutting planes in integer and mixed integer programming, A set packing model for the ground holding problem in congested networks, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., An enhanced rostering model for airline crews, A branch-and-cut algorithm for the maximum cardinality stable set problem, A LP-based heuristic for a time-constrained routing problem, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, Integral simplex using double decomposition for set partitioning problems, A branch-and-cut algorithm for the pallet loading problem, Combined bus and driver scheduling, Airline cockpit crew scheduling, A branch-and-cut algorithm for partition coloring, Preprocessing and cutting planes with conflict graphs, Optimal construction of airline individual crew pairings., Spherical classification of data, a new rule-based learning method, Improving set partitioning problem solutions by zooming around an improving direction, A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, Some aspects on solving transportation problem, A global MILP model for FMS scheduling, A tree search algorithm for the crew scheduling problem, Crew pairing at Air France, Minimum cost capacity installation for multicommodity network flows, A Lagrangian-based heuristic for large-scale set covering problems, Aircrew schedule generation using repeated matching, Gomory cuts revisited, ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions, Airline crew scheduling using Potts mean field techniques, RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING, A network model for airline cabin crew scheduling, Vehicle and crew scheduling for urban bus lines, Routing trains through a railway station based on a node packing model, A linear and discrete programming framework for representing qualitative knowledge, A set covering approach for multi-depot train driver scheduling, A concurrent processing framework for the set partitioning problem, Airline crew scheduling: state-of-the-art
