An Integer Programming Approach to the Vehicle Scheduling Problem
From MaRDI portal
Publication:4093231
Cited in
(55)- Continuity of care in home health care scheduling: a rolling horizon approach
- A new mixed integer programming approach for inverse correspondence analysis
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019
- Last‐mile delivery with drone and lockers
- A comparative study of alternative formulations for the periodic vehicle routing problem
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Vehicle routing on road networks: how good is Euclidean approximation?
- Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport
- On the integer properties of scheduling set partitioning models
- The savings algorithm for the vehicle routing problem
- Vehicle routing via column generation
- Implementation techniques for the vehicle routing problem
- The column-circular, subsets-selection problem: Complexity and solutions
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches.
- The vehicle routing problem: An overview of exact and approximate algorithms
- A structure for distribution studies
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Simultaneous disruption recovery of a train timetable and crew roster in real time
- Solving the minimum convex partition of point sets with integer programming
- Heuristics for vehicle routing problems: sequence or set optimization?
- A survey on matheuristics for routing problems
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types
- A surrogate heuristic for set covering problems
- Polyhedral study of the capacitated vehicle routing problem
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Algorithms for large scale set covering problems
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A hybrid heuristic for the set covering problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Scheduling trainees at a hospital department using a branch-and-price approach
- A branch-and-price algorithm for an integrated production and inventory routing problem
- A bi-criteria heuristic for the vehicle routing problem with time windows
- Forty years of periodic vehicle routing
- A Lagrangean relaxation heuristic for vehicle routing
- A matheuristic for the asymmetric capacitated vehicle routing problem
- An algorithm for set covering problem
- The period vehicle routing problem and its extensions
- A branch and bound algorithm for the capacitated vehicle routing problem
- The train driver recovery problem-a set partitioning based model and solution method
- Enhancing an algorithm for set covering problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- A branch-and-price approach for operational aircraft maintenance routing
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios
- Column generation for minimizing total completion time in a parallel-batching environment
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- Solving a continuous local access network design problem with a stabilized central column generation approach
- A branch-and-price approach for integrating nurse and surgery scheduling
- A TSSP+1 decomposition strategy for the vehicle routing problem
- A generalized exchange heuristic for the capacitated vehicle routing problem
This page was built for publication: An Integer Programming Approach to the Vehicle Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093231)
