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

Constraint programming and graph algorithms

โœ Scribed by Michel Gangnet; Burton Rosenberg

Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
992 KB
Volume
8
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A dynamic programming algorithm for mult
A dynamic programming algorithm for multiple-choice constraints
โœ Mary W. Cooper; Keyvan Farhangian ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

## This report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programmi

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