Technical, Research Report
@TechReport
Technischer-, Forschungsbericht


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked





Author, Editor

Author(s):

Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven

dblp
dblp
dblp

Not MPG Author(s):

Beldiceanu, Nicolas
Carlsson, Mats

Editor(s):





BibTeX Citekey*:

BCT2002:SumOfWeights

Language:

English

Title, Institution

Title*:

Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint

Institution*:

Swedish Institute of Computer Science

Publishers or Institutions Address*:

Uppsala, Sweden

Type:

Technical Report

No, Year, pp.,

Number*:

SICS-T-2002:14-SE

Pages*:

46

Month:

October

VG Wort
Pages*:

73

Year*:

2002

ISBN/ISSN:

1100-3154





DOI:




Note, Abstract, ©

Note:


(LaTeX) Abstract:

This article introduces the sum of weights of distinct values
constraint, which can be seen as a generalization of the number of
distinct values as well as of the alldifferent, and the relaxed
alldifferent constraints. This constraint holds if a cost variable is
equal to the sum of the weights associated to the distinct values taken
by a given set of variables. For the first aspect, which is related to
domination, we present four filtering algorithms. Two of them lead to
perfect pruning when each domain variable consists of one set of
consecutive values, while the two others take advantage of holes in the
domains. For the second aspect, which is connected to maximum matching
in a bipartite graph, we provide a complete filtering algorithm for the
general case. Finally we introduce several generic deduction rules,
which link both aspects of the constraint. These rules can be applied to
other optimization constraints such as the minimum weight alldifferent
constraint or the global cardinality constraint with costs. They also
allow taking into account external constraints for getting enhanced
bounds for the cost variable. In practice, the sum of weights of
distinct values constraint occurs in assignment problems where using a
resource once or several times costs the same. It also captures
domination problems where one has to select a set of vertices in order
to control every vertex of a graph.

Categories / Keywords:

Constraint Programming, Global Constraint, Cost Filtering, Assignment

Copyright Message:


HyperLinks / References / URLs:


Personal Comments:


File Upload:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:
@TECHREPORT{BCT2002:SumOfWeights,
AUTHOR = {Beldiceanu, Nicolas and Carlsson, Mats and Thiel, Sven},
TITLE = {Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint},
YEAR = {2002},
TYPE = {Technical Report},
INSTITUTION = {Swedish Institute of Computer Science},
NUMBER = {SICS-T-2002:14-SE},
PAGES = {46},
ADDRESS = {Uppsala, Sweden},
MONTH = {October},
ISBN = {1100-3154},
}


Entry last modified by Christine Kiesel, 07/15/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
12/19/2002 01:47:52 PM
Revisions
2.
1.
0.

Editor(s)
Christine Kiesel
Christine Kiesel
Sven Thiel

Edit Dates
05.09.2003 19:19:16
27.08.2003 16:25:58
19/12/2002 13:47:53

Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section