A Set Partitioning Approach to the Crew Scheduling Problem
From MaRDI portal
Recommendations
Cited in
(33)- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- An extension of set partitioning with application to scheduling problems
- On the integer properties of scheduling set partitioning models
- A tree search algorithm for the crew scheduling problem
- A dynamic programming based algorithm for the crew scheduling problem.
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- An exact algorithm for the simplified multiple depot crew scheduling problem
- Railway crew scheduling: models, methods and applications
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Engine scheduling by column generation
- A survey of resource constrained shortest path problems: exact solution approaches
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- scientific article; zbMATH DE number 4162637 (Why is no real title available?)
- A Multiplier Adjustment Approach for the Set Partitioning Problem
- scientific article; zbMATH DE number 1070503 (Why is no real title available?)
- scientific article; zbMATH DE number 1488070 (Why is no real title available?)
- A hybrid soft computing approach for subset problems
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- Progress in Artificial Intelligence
- A set covering based matheuristic for a real-world city logistics problem
- Solving the constrained shortest path problem using random search strategy
- Modeling and algorithmic development of a staff scheduling problem
- A new method for solving capacitated location problems based on a set partitioning approach
- Public transport for smart cities: recent innovations and future challenges
- New partitioning techniques and faster algorithms for approximate interval scheduling
- Contemporary approaches in matheuristics an updated survey
- Exact minimum weight spanners via column generation
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A dual ascent procedure for the set partitioning problem
This page was built for publication: A Set Partitioning Approach to the Crew Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545655)
