Robust Mask-Based Appointment Scheduling in Primary Care Practices

In most health care systems, a primary care physician (PCP) is both the first instance consulted by patients with medical concerns and the instance coordinating patients’ continued access to medical care. Due to the PCP’s pivotal role, we address challenges of a high-quality primary care service by interday appointment scheduling on a tactical decision level. Our … Read more

Minimum Color-Degree Perfect b -Matchings

The minimum color-degree perfect b-matching roblem (Col-BM) is a new extension of the perfect b-matching problem to edge-colored graphs. The objective of Col-BM is to minimize the maximum number of differently colored edges in a perfect b-matching that are incident to the same node. We show that Col-BM is NP-hard on bipartite graphs by a … Read more

The Synthesis Problem of Decentralized Energy Systems is strongly NP-hard

We analyze the computational complexity of the synthesis problem of decentralized energy systems. This synthesis problem consists of combining various types of energy conversion units and determining their sizing as well as operations in order to meet time-varying energy demands while maximizing an objective function, e.g., the net present value. In this paper, we prove … Read more