Combining Benders decomposition and column generation for multi-activity tour scheduling
From MaRDI portal
Publication:1652589
DOI10.1016/j.cor.2018.01.014zbMath1391.90363OpenAlexW2792100996MaRDI QIDQ1652589
Maria I. Restrepo, Louis-Martin Rousseau, Bernard Gendron
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.014
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70)
Related Items (3)
Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Flexible weekly tour scheduling for postal service workers using a branch and price
- Using Benders decomposition to implicitly model tour scheduling
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A \texttt{cost-regular} based hybrid column generation approach
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- Practical enhancements to the Magnanti-Wong method
- Cut generation for an employee timetabling problem
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Staff scheduling and rostering: a review of applications, methods and models.
- An annotated bibliography of personnel scheduling and rostering
- Survey, categorization, and comparison of recent tour scheduling literature
- Personnel scheduling: a literature review
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
- Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic
- Formal languages for integer programming modeling of shift scheduling problems
- A branch-and-price approach for large-scale employee tour scheduling problems
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
- Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling
- Branch-and-Price for Personalized Multiactivity Tour Scheduling
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Decomposing Global Grammar Constraints
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Solving Large-Scale Tour Scheduling Problems
- Optimal Shift Scheduling with Multiple Break Windows
- Overlapping Start-Time Bands in Implicit Tour Scheduling
- Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
This page was built for publication: Combining Benders decomposition and column generation for multi-activity tour scheduling
