Modeling and analyzing soft constraint optimization: Resource allocation as a case study (2001)
Download:
|
|
by Weixiong Zhang, Kenneth Swanson, Michael P. Moran
http://www.lsi.upc.es/~larrosa/Soft01papers/Weixiong.ps.gz
Add To MetaCart
Abstract:
Abstract. We study a resource allocation problem, which is a central piece of a real-world task scheduling problem. We rst formulate the problem as a soft constraint optimization problem and show that nding the optimal resource allocation is NP-hard. We then propose and study three soft constraint modeling schemes for the problem and discuss the expressiveness and space complexity of these models. 1
Citations
| 7715 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 511 | A machine program for theorem proving – Davis, Logemann, et al. - 1962 |
| 246 | Scene labeling by relaxation operations – Rosenfeld, Hummel, et al. - 1976 |
| 243 | Constraint Satisfaction – Mackworth - 1987 |
| 224 | Valued Constraint Satisfaction Problems: hard and easy problems – Schiex, Fargier, et al. - 1995 |
| 150 | Semiring-based constraint solving and optimization – Bistarelli, U, et al. - 1997 |
| 76 | Uncertainty in constraint satisfaction problems: a probabilistic approach – Fargier, Lang - 1993 |
| 49 | Noise strategies for local search – Selman, Kautz, et al. - 1994 |
| 29 | Modelling a Permutation Problem – Smith - 2000 |
| 27 | Permutation Problems and Channelling Constraints – Walsh - 2001 |
| 1 | Marbles: A family of cooperative negotiation schemes for real-time fault-tolerant distributed resource allocation – Frank, Bugacov, et al. - 2001 |
