Waldemar Kocjan, Per Kreuger, Bjorn Lisper Malardalen University, Vasteras, ...  Home/Search
Context
Related
| mrtc.mdh.se/publications/0821.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mrtc.mdh.se/sho...lications.phtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The symmetric cardinality constraint is described in terms of a set of variables X = {x1 , . . . , xk}, which take their values as subsets of V = {v1 , . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [l x i , ux i ] and at the same time it restricts the number of occurrences of each value v j V in the sets assigned to variables in X to be in an other interval [l v j , uv j ]. In this paper we extend the symmetric cardinality... (Update)
Active bibliography (related documents): More All
0.4: On Global Warming (Softening Global Constraints) - van Hoeve, Pesant, Rousseau (Correct)
0.4: A Hyper-Arc Consistency Algorithm for the Soft Alldierent.. - van Hoeve (2004) (Correct)
0.2: Efficient Algorithms for Optimum Cycle Mean and Optimum.. - Dasdan, Irani, Gupta (1999) (Correct)
Similar documents based on text: More All
1.6: Maintaining Consistency of Dynamic Cardinality Constraints.. - Waldemar Kocjan Per (Correct)
0.7: Filtering Methods for Symmetric Cardinality - Waldemar Kocjan Per (2003) (Correct)
0.6: Development of Parallel Algorithms in Data Field Haskell - Holmerin, Lisper (2000) (Correct)
BibTeX entry: (Update)
@misc{ per-symmetric,
author = "Waldemar Kocjan Per",
title = "Symmetric Cardinality Constraint with Costs",
url = "citeseer.ist.psu.edu/718502.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 2001
473 Foundation of Constraint Satisfaction (context) - Tsang - 1993
405 Depth--First Search and Linear Graph Algorithms (context) - Tarjan - 1972
206 Rinehart and Winston (context) - Lawler - 1976
97 Shortest Paths Algorithms: Theory and Experimental Evaluatio.. - Cherkassky, Goldberg et al. - 1996
35 A language and a program for stating and solving combinatori.. (context) - Lauriere - 1978
33 Generalized Arc Consistency for Global Cardinality Constrain.. (context) - Regin - 1996
8 Prentice--Hall Inc (context) - Ahuja, Magnanti et al. - 1993
6 Arc Consistency for Global Cardinality Constraints with Cost.. (context) - Regin - 1999
4 Cost--Based Arc Consistency for Global Cardinality Constrain.. (context) - Regin - 2002
4 Computational Investigations of Maximum Flow Algorithms (context) - Ahuja, Kodialam et al. - 1997
1 Filtering Methods for Symmetric Cardinality Constraint (context) - Kocjan, Kreuger - 2004
Documents on the same site (http://www.mrtc.mdh.se/showPublications.phtml): More
Managing Complex Systems - Challenges for PDM and SCM - Dahlqvist, Crnkovic, Larsson (Correct)
Configuration Management for Component-based Systems - Larsson, Crnkovic (2001) (Correct)
Simulation Analysis of Sporadic and Aperiodic Task Handling - Isovic, Fohler (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC