Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
type: Item
instance of: scholarly article
title: Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
zbMATH Open document ID: 1380.90196
author: Wasakorn Laesanklang
author: Dario Landa-Silva
published in: Annals of Operations Research
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6840132
zbMATH Keywords: home healthcare planning
zbMATH Keywords: workforce scheduling and routing
zbMATH Keywords: mixed integer programming
zbMATH Keywords: problem decomposition
zbMATH Keywords: heuristic decomposition
describes a project that uses: SPSS
MaRDI profile type: Publication
Wikidata QID: Q59613704
full work available at URL: s10479-016-2352-8
OpenAlex ID: W2532513511
cites work: Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Workforce scheduling and routing problems: literature survey and computational study
cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
cites work: Scheduling and routing of automated guided vehicles: A hybrid approach
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A branch-and-price approach for large-scale employee tour scheduling problems
cites work: A parallel matheuristic for the technician routing and scheduling problem
cites work: Heuristic solutions to multi-depot location-routing problems
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Q3372333
cites work: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: Using Benders decomposition to implicitly model tour scheduling
cites work: An augmented Lagrangian decomposition method for block diagonal linear programming problems
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: Reformulation and Decomposition of Integer Programs
DBLP publication ID: journals/anor/LaesanklangL17
DOI: 10.1007/S10479-016-2352-8
description: scientific article; zbMATH DE number 6840132