Decomposition techniques with mixed integer programming and heuristics for home healthcare planning

DOI10.1007/s10479-016-2352-8zbMath1380.90196DBLPjournals/anor/LaesanklangL17OpenAlexW2532513511WikidataQ59613704 ScholiaQ59613704MaRDI QIDQ1699130

Dario Landa-Silva, Wasakorn Laesanklang

Publication date: 16 February 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2352-8

zbMATH Keywords

mixed integer programmingproblem decompositionheuristic decompositionhome healthcare planningworkforce scheduling and routing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Pre-auction lane selection in an integrated production–distribution planning problem ⋮ Bicriteria vehicle routing problem with preferences and timing constraints in home health care services

Uses Software

• SPSS

Cites Work

• Unnamed Item
• Workforce scheduling and routing problems: literature survey and computational study
• A parallel matheuristic for the technician routing and scheduling problem
• Using Benders decomposition to implicitly model tour scheduling
• Scheduling and routing of automated guided vehicles: A hybrid approach
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Partitioning procedures for solving mixed-variables programming problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Heuristic solutions to multi-depot location-routing problems
• A survey on Benders decomposition applied to fixed-charge network design problems
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Routing and scheduling in a flexible job shop by tabu search
• A branch-and-price approach for large-scale employee tour scheduling problems
• The Cutting-Plane Method for Solving Convex Programs
• Reformulation and Decomposition of Integer Programs
• Parallel iterative search methods for vehicle routing problems
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem

This page was built for publication: Decomposition techniques with mixed integer programming and heuristics for home healthcare planning