You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact

Maintaining Consistency of Dynamic Cardinality Constraints with Costs


Publication Type:

Report - MRTC




This paper introduce a novel method for maintaining consistency of cardinality constraints in context of dynamic constraint satisfaction. The presented method adopt sensitivity analysis for feasible and minimum cost flows underlying all cardinality constraints. Moreover, we extend a dynamic all-pairs shortest path algorithm to support weight changes, insertion and deletion of multiple edges and show how this algorithm can be used to maintain consistency of values with the modified constraint.


author = {Waldemar Kocjan and Bj{\"o}rn Lisper},
title = {Maintaining Consistency of Dynamic Cardinality Constraints with Costs},
number = {ISSN 1404-3041 ISRN MDH-MRTC-168/2005-1-SE},
month = {January},
year = {2005},
url = {}