Solving Airline Crew Scheduling Problems by Branch-and-Cut
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A global MILP model for FMS scheduling
- A tree search algorithm for the crew scheduling problem
- Crew pairing at Air France
- Solving large scale crew scheduling problems
- Minimum cost capacity installation for multicommodity network flows
- A Lagrangian-based heuristic for large-scale set covering problems
- Aircrew schedule generation using repeated matching
- A linear and discrete programming framework for representing qualitative knowledge
- Design rules for application specific dynamical systems
- Some thoughts on combinatorial optimisation
- An intelligent system for US Coast Guard cutter scheduling
- A dynamic programming based algorithm for the crew scheduling problem.
- Staff scheduling and rostering: a review of applications, methods and models.
- Pricing combinatorial auctions.
- 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
- Routing trains through a railway station based on a node packing model
- Modeling and solving an airline schedule generation problem
- A concurrent processing framework for the set partitioning problem
- The matching relaxation for a class of generalized set partitioning problems
- 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
- On the mixed set covering, packing and partitioning polytope
- Modelling transfer line design problem via a set partitioning problem
- A branch-and-cut algorithm for the pallet loading problem
- A network model for airline cabin crew scheduling
- Application of a hybrid genetic algorithm to airline crew scheduling
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms
- Conflict graphs in solving integer programming problems
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- Preprocessing and cutting planes with conflict graphs
- Spherical classification of data, a new rule-based learning method
- Distributed integral column generation for set partitioning problems
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
- Integral simplex using double decomposition for set partitioning problems
- Improving set partitioning problem solutions by zooming around an improving direction
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- A set covering approach for multi-depot train driver scheduling
- Subadditive approaches in integer programming
- An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- Modeling and solving a crew assignment problem in air transportation
- Measuring the impact of primal heuristics
- A new modeling and solution approach for the set-partitioning problem
- A relax-and-cut algorithm for the set partitioning problem
- Metaheuristics approach to the aircrew rostering problem
- Effective search space control for large and/or complex driver scheduling problems
- A LP-based heuristic for a time-constrained routing problem
- Gomory cuts revisited
- Vehicle and crew scheduling for urban bus lines
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Enhancing CLP branch and bound techniques for scheduling problems
- Solving a truck dispatching scheduling problem using branch-and-cut
- The operational airline crew scheduling problem
- A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
- Integer programming techniques for the nurse rostering problem
- Linear temporal logic vehicle routing with applications to multi-UAV mission planning
- A branch-and-cut algorithm for partition coloring
- Production systems with limited repair capacity
- Some aspects on solving transportation problem
- Strong lift-and-project cutting planes for the stable set problem
- scientific article; zbMATH DE number 1206105 (Why is no real title available?)
- scientific article; zbMATH DE number 1054679 (Why is no real title available?)
- scientific article; zbMATH DE number 1058043 (Why is no real title available?)
- Airline Crew Scheduling with Time Windows and Plane-Count Constraints
- A Set Partitioning Approach to the Crew Scheduling Problem
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Use of hidden network structure in the set partitioning problem
- Learning in combinatorial optimization: what and how to explore
- Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
- Searching for optimal integer solutions to set partitioning problems using column generation
- scientific article; zbMATH DE number 2227477 (Why is no real title available?)
- Classical cuts for mixed-integer programming and branch-and-cut
- A set packing model for the ground holding problem in congested networks
- An enhanced rostering model for airline crews
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- Combined bus and driver scheduling
- Airline cockpit crew scheduling
- Optimal construction of airline individual crew pairings.
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- A three-phase heuristic for the fairness-oriented crew rostering problem
- A note on branch-and-cut-and-price
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
- Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Cutting planes in integer and mixed integer programming
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
- Solving the traveling salesman problem via different quantum computing architectures
- Airline crew scheduling: state-of-the-art
- \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
- Computational study of large-scale p-median problems
This page was built for publication: Solving Airline Crew Scheduling Problems by Branch-and-Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274629)
