Optimal shift partitioning of pharmacies

DOI10.1016/J.COR.2014.09.009zbMATH Open1348.90368OpenAlexW2068561496MaRDI QIDQ337411FDOQ337411

Authors: Giovanni Andreatta, Luigi De Giovanni, 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

Recommendations

• Pharmacy duty scheduling problem
• A branch and price algorithm for the pharmacy duty scheduling problem
• Variable neighborhood search for the pharmacy duty scheduling problem
• Optimal shift coloring of trees
• scientific article; zbMATH DE number 1462943

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)

Cites Work

• SCIP: solving constraint integer programs
• Title not available (Why is that?)
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Title not available (Why is that?)
• Branch-and-price: Column generation for solving huge integer programs
• Title not available (Why is that?)
• Solution methods for thep-median problem: An annotated bibliography
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimal shift coloring of trees
• Pharmacy duty scheduling problem

Cited In (6)

• Pharmacy duty scheduling problem
• Constrained domatic bipartition on trees
• A branch and price algorithm for the pharmacy duty scheduling problem
• Optimal logistics strategy to distribute medicines in clinics and hospitals
• Star partitions on graphs
• Optimal shift coloring of trees

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337411)