Pages that link to "Item:Q4274629"
From MaRDI portal
The following pages link to Solving Airline Crew Scheduling Problems by Branch-and-Cut (Q4274629):
Displaying 50 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care (Q819093) (← links)
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases (Q819123) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system (Q869153) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Duty-period-based network model for crew rescheduling in European airlines (Q880547) (← links)
- Column generation in the integral simplex method (Q948677) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- An integer programming approach to generating airline crew pairings (Q958462) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- A global MILP model for FMS scheduling (Q1278123) (← links)
- A tree search algorithm for the crew scheduling problem (Q1278340) (← links)
- Crew pairing at Air France (Q1278613) (← links)
- Solving large scale crew scheduling problems (Q1278615) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
- Aircrew schedule generation using repeated matching (Q1291572) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Design rules for application specific dynamical systems (Q1348553) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- An intelligent system for US Coast Guard cutter scheduling (Q1390329) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
- Staff scheduling and rostering: a review of applications, methods and models. (Q1417478) (← links)
- Pricing combinatorial auctions. (Q1420433) (← links)
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions (Q1578557) (← links)
- Airline crew scheduling using Potts mean field techniques (Q1579464) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Modeling and solving an airline schedule generation problem (Q1599336) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- A network model for airline cabin crew scheduling (Q1848580) (← links)
- Application of a hybrid genetic algorithm to airline crew scheduling (Q1915974) (← links)
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
