Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints
From MaRDI portal
Publication:4632916
DOI10.1002/nav.21683zbMath1411.90195OpenAlexW2330449564MaRDI QIDQ4632916
Andrew E. B. Lim, Wenbin Zhu, Hu Qin, Zhi-Xing Luo
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21683
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items (3)
Selective routing problem with synchronization ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants
Uses Software
This page was built for publication: Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints
