Waste management in health institutions has become important in recent years because of the increase in population and industrialization. Waste generated from health institutions has risks for human health and the environment. Therefore, this paper presents a reverse logistics optimization for waste collection and disposal in Turkish health institutions. A multiperiod, multitype product waste r...

We consider the problem of retrieving the k documents from a collection of strings where a given pattern P appears most often. We show that, by representing the collection using a Compressed Suffix Array CSA, a data structure using the asymptotically optimal |CSA|+o(n) bits can answer queries in the time needed by CSA to find the suffix array interval of the pattern plus O(k lg k lg n) accesses...

We study how a manufacturer’s recycled content claim decision is impacted by demand for recycled content through environmentally preferable purchasing (EPP) programs and supply uncertainty. We model a manufacturer making a recycled content commitment that can commit to a minimum recycled content that holds for every period (product specific claim), or an average recycled content across periods ...

Introduction: About 50 to 70 percent of the waste management total cost is spent on collection operations, so any little progress in reducing collection costs could significantly reduce total costs. This study aimed to analyze the collection and transportation of municipal solid waste cost in Yazd in the next 15 years. Materials and Methods: The study location (five areas) was different urban ...

One of the central problems for near-term quantum devices is to understand their ultimate potential and limitations. We address this problem in terms error mitigation by introducing a framework taking into account full expressibility devices, which optimal resource cost probabilistic cancellation method can be formalized. provide general methodology evaluating connecting it resource-theoretic q...

The cost of an optimal delete relaxed plan, known as h+, is a powerful admissible heuristic but in general intractable to compute. In this paper we examine the problem computing h+ by encoding it MAXSAT problem. We develop new that utilizes constraint generation support computation sequence increasing lower bounds on h+. show close connection between computations performed recent approach for s...

We study the problem of minimizing the expected cost of binary searching for data where the access cost is not xed and depends on the last accessed element, such as data stored in magnetic or optical disk. We present an optimal algorithm for this problem that nds the optimal search strategy in O(n 3) time, which is the same time complexity of the simpler classical problem of xed costs. Next, we...