Optimal shift partitioning of pharmacies

DOI10.1016/j.cor.2014.09.009zbMath1348.90368OpenAlexW2068561496MaRDI 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

zbMATH Keywords

computational complexitybranch-and-priceshift partitioning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Theory of organizations, manpower planning in operations research (90B70)

Related Items (3)

Constrained domatic bipartition on trees ⋮ Star partitions on graphs ⋮ Optimal shift coloring of trees

Uses Software

• Tabu search

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

This page was built for publication: Optimal shift partitioning of pharmacies