## Abstract This article considers the problem of using synchronous mobile agents to decontaminate the nodes of a graph given a spreading contamination. We begin by considering the problem of minimizing cleaning time, given initial agent, and contamination locations. Then, we take as input a set of
✦ LIBER ✦
An integer programming model for the weekly tour scheduling problem
✍ Scribed by Tolga Çezik; Oktay Günlük; Hanan Luss
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 195 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0894-069X
- DOI
- 10.1002/nav.1037
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Integer programming models and algorithm
✍
John Penuel; J. Cole Smith; Siqian Shen
📂
Article
📅
2012
🏛
John Wiley and Sons
🌐
English
⚖ 371 KB
👁 1 views
An approximate mixed integer linear prog
✍
R. R. Tan; D. C. Y. Foo; D. K. S. Ng; C. L. Chiang; S. Hul; V. Ku-Pineda
📂
Article
📅
2007
🏛
Wiley (John Wiley & Sons)
🌐
English
⚖ 128 KB
## Abstract Recent trends in process engineering have placed increased emphasis on the design of inherently clean and efficient processes. For example, a wide range of pinch analysis and mathematical programming methods have been developed for designing schemes for water reuse/recycle in industrial