Optimal shift partitioning of pharmacies
From MaRDI portal
Publication:337411
DOI10.1016/j.cor.2014.09.009zbMath1348.90368MaRDI QIDQ337411
Luigi De Giovanni, Giovanni Andreatta, Paolo Serafini
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3146991
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C60: Abstract computational complexity for mathematical programming problems
90B70: Theory of organizations, manpower planning in operations research
Related Items
Constrained domatic bipartition on trees, Optimal shift coloring of trees, Star partitions on graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SCIP: solving constraint integer programs
- Optimal shift coloring of trees
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Pharmacy duty scheduling problem
- Solution methods for thep-median problem: An annotated bibliography
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph