๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Non-classical preference models in combinatorial problems: Models and algorithms for graphs

โœ Scribed by Olivier Spanjaard

Publisher
Springer
Year
2004
Tongue
English
Weight
47 KB
Volume
2
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Integer programming models and algorithm
Integer programming models and algorithms for the graph decontamination problem with mobile agents
โœ John Penuel; J. Cole Smith; Siqian Shen ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 371 KB ๐Ÿ‘ 1 views

## 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