Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity
DOI10.1287/ijoc.2021.1119zbMath1492.90056OpenAlexW3214722735MaRDI QIDQ5086014
Alexander Jungwirth, Rainer Kolisch, Guy Desaulniers, Markus M. Frey
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1119
vehicle routingexact branch-price-and-cutflexible service locationshospital therapist schedulingtime-dependent location capacity
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic to solve the synchronized log-truck scheduling problem
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Event-based MILP models for resource-constrained project scheduling problems
- Methods for routing with time windows
- An exact algorithm for IP column generation
- Logic-based Benders decomposition
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Home health care routing and scheduling: a review
- Resource constrained routing and scheduling: review and research prospects
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The vehicle routing-allocation problem: A unifying framework
- Branching rules revisited
- A new branching strategy for time constrained routing problems with application to backhauling
- An efficient transformation of the generalized vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- Dynamic transportation of patients in hospitals
- The green vehicle routing problem with capacitated alternative fuel stations
- Improved branch-cut-and-price for capacitated vehicle routing
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- Dynamic transport scheduling under multiple resource constraints
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Vehicle Routing
- The Surgical Patient Routing Problem: A Central Planner Approach
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Routing with time windows by column generation
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A GRASP for the Vehicle Routing Problem with Time Windows
- Column Generation
- Shortest Path Problems with Resource Constraints
- Integer Programming and Combinatorial Optimization
- Selective arc‐ng pricing for vehicle routing
This page was built for publication: Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity
