An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constrain...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Quimper, Claude-Guy [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2005 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science + Business Media, Inc. 2005 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Constraints - Kluwer Academic Publishers, 1996, 10(2005), 2 vom: Apr., Seite 115-135 |
|---|---|
| Übergeordnetes Werk: |
volume:10 ; year:2005 ; number:2 ; month:04 ; pages:115-135 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10601-005-0552-y |
|---|
| Katalog-ID: |
OLC2027267034 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2027267034 | ||
| 003 | DE-627 | ||
| 005 | 20230503033511.0 | ||
| 007 | tu | ||
| 008 | 200819s2005 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10601-005-0552-y |2 doi | |
| 035 | |a (DE-627)OLC2027267034 | ||
| 035 | |a (DE-He213)s10601-005-0552-y-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Quimper, Claude-Guy |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| 264 | 1 | |c 2005 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science + Business Media, Inc. 2005 | ||
| 520 | |a Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. | ||
| 650 | 4 | |a global constraints | |
| 650 | 4 | |a bounds consistency | |
| 650 | 4 | |a domain consistency | |
| 700 | 1 | |a Golynski, Alexander |4 aut | |
| 700 | 1 | |a López-Ortiz, Alejandro |4 aut | |
| 700 | 1 | |a Van Beek, Peter |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Constraints |d Kluwer Academic Publishers, 1996 |g 10(2005), 2 vom: Apr., Seite 115-135 |w (DE-627)230798985 |w (DE-600)1388291-0 |w (DE-576)060397772 |x 1383-7133 |7 nnns |
| 773 | 1 | 8 | |g volume:10 |g year:2005 |g number:2 |g month:04 |g pages:115-135 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10601-005-0552-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4307 | ||
| 951 | |a AR | ||
| 952 | |d 10 |j 2005 |e 2 |c 04 |h 115-135 | ||
| author_variant |
c g q cgq a g ag a l o alo b p v bp bpv |
|---|---|
| matchkey_str |
article:13837133:2005----::nfiinbudcnitnyloihfrhgoac |
| hierarchy_sort_str |
2005 |
| publishDate |
2005 |
| allfields |
10.1007/s10601-005-0552-y doi (DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p DE-627 ger DE-627 rakwb eng 004 VZ Quimper, Claude-Guy verfasserin aut An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. global constraints bounds consistency domain consistency Golynski, Alexander aut López-Ortiz, Alejandro aut Van Beek, Peter aut Enthalten in Constraints Kluwer Academic Publishers, 1996 10(2005), 2 vom: Apr., Seite 115-135 (DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 1383-7133 nnns volume:10 year:2005 number:2 month:04 pages:115-135 https://doi.org/10.1007/s10601-005-0552-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 AR 10 2005 2 04 115-135 |
| spelling |
10.1007/s10601-005-0552-y doi (DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p DE-627 ger DE-627 rakwb eng 004 VZ Quimper, Claude-Guy verfasserin aut An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. global constraints bounds consistency domain consistency Golynski, Alexander aut López-Ortiz, Alejandro aut Van Beek, Peter aut Enthalten in Constraints Kluwer Academic Publishers, 1996 10(2005), 2 vom: Apr., Seite 115-135 (DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 1383-7133 nnns volume:10 year:2005 number:2 month:04 pages:115-135 https://doi.org/10.1007/s10601-005-0552-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 AR 10 2005 2 04 115-135 |
| allfields_unstemmed |
10.1007/s10601-005-0552-y doi (DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p DE-627 ger DE-627 rakwb eng 004 VZ Quimper, Claude-Guy verfasserin aut An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. global constraints bounds consistency domain consistency Golynski, Alexander aut López-Ortiz, Alejandro aut Van Beek, Peter aut Enthalten in Constraints Kluwer Academic Publishers, 1996 10(2005), 2 vom: Apr., Seite 115-135 (DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 1383-7133 nnns volume:10 year:2005 number:2 month:04 pages:115-135 https://doi.org/10.1007/s10601-005-0552-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 AR 10 2005 2 04 115-135 |
| allfieldsGer |
10.1007/s10601-005-0552-y doi (DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p DE-627 ger DE-627 rakwb eng 004 VZ Quimper, Claude-Guy verfasserin aut An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. global constraints bounds consistency domain consistency Golynski, Alexander aut López-Ortiz, Alejandro aut Van Beek, Peter aut Enthalten in Constraints Kluwer Academic Publishers, 1996 10(2005), 2 vom: Apr., Seite 115-135 (DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 1383-7133 nnns volume:10 year:2005 number:2 month:04 pages:115-135 https://doi.org/10.1007/s10601-005-0552-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 AR 10 2005 2 04 115-135 |
| allfieldsSound |
10.1007/s10601-005-0552-y doi (DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p DE-627 ger DE-627 rakwb eng 004 VZ Quimper, Claude-Guy verfasserin aut An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. global constraints bounds consistency domain consistency Golynski, Alexander aut López-Ortiz, Alejandro aut Van Beek, Peter aut Enthalten in Constraints Kluwer Academic Publishers, 1996 10(2005), 2 vom: Apr., Seite 115-135 (DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 1383-7133 nnns volume:10 year:2005 number:2 month:04 pages:115-135 https://doi.org/10.1007/s10601-005-0552-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 AR 10 2005 2 04 115-135 |
| language |
English |
| source |
Enthalten in Constraints 10(2005), 2 vom: Apr., Seite 115-135 volume:10 year:2005 number:2 month:04 pages:115-135 |
| sourceStr |
Enthalten in Constraints 10(2005), 2 vom: Apr., Seite 115-135 volume:10 year:2005 number:2 month:04 pages:115-135 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
global constraints bounds consistency domain consistency |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Constraints |
| authorswithroles_txt_mv |
Quimper, Claude-Guy @@aut@@ Golynski, Alexander @@aut@@ López-Ortiz, Alejandro @@aut@@ Van Beek, Peter @@aut@@ |
| publishDateDaySort_date |
2005-04-01T00:00:00Z |
| hierarchy_top_id |
230798985 |
| dewey-sort |
14 |
| id |
OLC2027267034 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2027267034</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503033511.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10601-005-0552-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027267034</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10601-005-0552-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Quimper, Claude-Guy</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, Inc. 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">global constraints</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bounds consistency</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">domain consistency</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Golynski, Alexander</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">López-Ortiz, Alejandro</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Beek, Peter</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Constraints</subfield><subfield code="d">Kluwer Academic Publishers, 1996</subfield><subfield code="g">10(2005), 2 vom: Apr., Seite 115-135</subfield><subfield code="w">(DE-627)230798985</subfield><subfield code="w">(DE-600)1388291-0</subfield><subfield code="w">(DE-576)060397772</subfield><subfield code="x">1383-7133</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:2</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:115-135</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10601-005-0552-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2005</subfield><subfield code="e">2</subfield><subfield code="c">04</subfield><subfield code="h">115-135</subfield></datafield></record></collection>
|
| author |
Quimper, Claude-Guy |
| spellingShingle |
Quimper, Claude-Guy ddc 004 misc global constraints misc bounds consistency misc domain consistency An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| authorStr |
Quimper, Claude-Guy |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)230798985 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1383-7133 |
| topic_title |
004 VZ An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint global constraints bounds consistency domain consistency |
| topic |
ddc 004 misc global constraints misc bounds consistency misc domain consistency |
| topic_unstemmed |
ddc 004 misc global constraints misc bounds consistency misc domain consistency |
| topic_browse |
ddc 004 misc global constraints misc bounds consistency misc domain consistency |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Constraints |
| hierarchy_parent_id |
230798985 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Constraints |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)230798985 (DE-600)1388291-0 (DE-576)060397772 |
| title |
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| ctrlnum |
(DE-627)OLC2027267034 (DE-He213)s10601-005-0552-y-p |
| title_full |
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| author_sort |
Quimper, Claude-Guy |
| journal |
Constraints |
| journalStr |
Constraints |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2005 |
| contenttype_str_mv |
txt |
| container_start_page |
115 |
| author_browse |
Quimper, Claude-Guy Golynski, Alexander López-Ortiz, Alejandro Van Beek, Peter |
| container_volume |
10 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Quimper, Claude-Guy |
| doi_str_mv |
10.1007/s10601-005-0552-y |
| dewey-full |
004 |
| title_sort |
an efficient bounds consistency algorithm for the global cardinality constraint |
| title_auth |
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| abstract |
Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. © Springer Science + Business Media, Inc. 2005 |
| abstractGer |
Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. © Springer Science + Business Media, Inc. 2005 |
| abstract_unstemmed |
Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications. © Springer Science + Business Media, Inc. 2005 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_100 GBV_ILN_2021 GBV_ILN_4305 GBV_ILN_4307 |
| container_issue |
2 |
| title_short |
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint |
| url |
https://doi.org/10.1007/s10601-005-0552-y |
| remote_bool |
false |
| author2 |
Golynski, Alexander López-Ortiz, Alejandro Van Beek, Peter |
| author2Str |
Golynski, Alexander López-Ortiz, Alejandro Van Beek, Peter |
| ppnlink |
230798985 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10601-005-0552-y |
| up_date |
2024-07-03T14:41:08.166Z |
| _version_ |
1803569246411685888 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2027267034</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503033511.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10601-005-0552-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027267034</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10601-005-0552-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Quimper, Claude-Guy</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, Inc. 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">global constraints</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bounds consistency</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">domain consistency</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Golynski, Alexander</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">López-Ortiz, Alejandro</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Van Beek, Peter</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Constraints</subfield><subfield code="d">Kluwer Academic Publishers, 1996</subfield><subfield code="g">10(2005), 2 vom: Apr., Seite 115-135</subfield><subfield code="w">(DE-627)230798985</subfield><subfield code="w">(DE-600)1388291-0</subfield><subfield code="w">(DE-576)060397772</subfield><subfield code="x">1383-7133</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:2</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:115-135</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10601-005-0552-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2005</subfield><subfield code="e">2</subfield><subfield code="c">04</subfield><subfield code="h">115-135</subfield></datafield></record></collection>
|
| score |
7.4018097 |