Identifying and exploiting problem structures using explanation-based constraint programming
Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified with...
Gespeichert in:
| Veröffentlicht in: | Constraints (Dordrecht) 2006-12, Vol.11 (4), p.295-313 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 313 |
|---|---|
| container_issue | 4 |
| container_start_page | 295 |
| container_title | Constraints (Dordrecht) |
| container_volume | 11 |
| creator | CAMBAZARD, Hadrien JUSSIEN, Narendra |
| description | Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. The next step is to design algorithms that adaptively integrate that kind of information during search. We claim in this paper, inspired by previous work on impact-based search strategies for constraint programming, that using an explanation-based constraint solver may lead to collect invaluable information on the intimate dynamically revealed and static structures of a problem instance. Moreover, we discuss how dedicated OR solving strategies (such as Benders decomposition) could be adapted to constraint programming when specific relationships between variables are exhibited. |
| doi_str_mv | 10.1007/s10601-006-9002-8 |
| format | Article |
| fullrecord | <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00293899v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00293899v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c352t-dd6ebd02f1bb6ebea5229d4e468a452a17806ffc1394ab7f2d11ade8409a3f823</originalsourceid><addsrcrecordid>eNpFkMtOAyEUQInRxFr9AHezceECvcA8YNk0aps0caM7E3JngIqZRwNTo38vkzG64gLn3MUh5JrBHQOo7iODEhgFKKkC4FSekAUrKk6VKPLTNAspaMWEOCcXMX4AgKpEviBvW2P70btv3-8z7E1mvw7t4MfpeghD3doui2M4NuMx2Jgd4_QxMdjj6Iee1hityZqhTxT6fpysfcCuS-AlOXPYRnv1ey7J6-PDy3pDd89P2_VqRxtR8JEaU9raAHesrtNkseBcmdzmpcS84MgqCaVzDRMqx7py3DCGxsocFAonuViS23nvO7b6EHyH4VsP6PVmtdPTWyqihFTqkyWWzWwThhiDdX8CAz2l1HPK5JR6Sqllcm5m54CxwdYF7Bsf_0UpZMlTzx-OVnYs</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Identifying and exploiting problem structures using explanation-based constraint programming</title><source>SpringerNature Journals</source><creator>CAMBAZARD, Hadrien ; JUSSIEN, Narendra</creator><creatorcontrib>CAMBAZARD, Hadrien ; JUSSIEN, Narendra</creatorcontrib><description>Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. The next step is to design algorithms that adaptively integrate that kind of information during search. We claim in this paper, inspired by previous work on impact-based search strategies for constraint programming, that using an explanation-based constraint solver may lead to collect invaluable information on the intimate dynamically revealed and static structures of a problem instance. Moreover, we discuss how dedicated OR solving strategies (such as Benders decomposition) could be adapted to constraint programming when specific relationships between variables are exhibited.</description><identifier>ISSN: 1383-7133</identifier><identifier>EISSN: 1572-9354</identifier><identifier>DOI: 10.1007/s10601-006-9002-8</identifier><identifier>CODEN: CNSTFT</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Artificial Intelligence ; Computer Science ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science ; Operations Research</subject><ispartof>Constraints (Dordrecht), 2006-12, Vol.11 (4), p.295-313</ispartof><rights>2007 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c352t-dd6ebd02f1bb6ebea5229d4e468a452a17806ffc1394ab7f2d11ade8409a3f823</citedby><cites>FETCH-LOGICAL-c352t-dd6ebd02f1bb6ebea5229d4e468a452a17806ffc1394ab7f2d11ade8409a3f823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,309,310,314,780,784,789,790,885,23930,23931,25140,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18386297$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00293899$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>CAMBAZARD, Hadrien</creatorcontrib><creatorcontrib>JUSSIEN, Narendra</creatorcontrib><title>Identifying and exploiting problem structures using explanation-based constraint programming</title><title>Constraints (Dordrecht)</title><description>Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. The next step is to design algorithms that adaptively integrate that kind of information during search. We claim in this paper, inspired by previous work on impact-based search strategies for constraint programming, that using an explanation-based constraint solver may lead to collect invaluable information on the intimate dynamically revealed and static structures of a problem instance. Moreover, we discuss how dedicated OR solving strategies (such as Benders decomposition) could be adapted to constraint programming when specific relationships between variables are exhibited.</description><subject>Applied sciences</subject><subject>Artificial Intelligence</subject><subject>Computer Science</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations Research</subject><issn>1383-7133</issn><issn>1572-9354</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpFkMtOAyEUQInRxFr9AHezceECvcA8YNk0aps0caM7E3JngIqZRwNTo38vkzG64gLn3MUh5JrBHQOo7iODEhgFKKkC4FSekAUrKk6VKPLTNAspaMWEOCcXMX4AgKpEviBvW2P70btv3-8z7E1mvw7t4MfpeghD3doui2M4NuMx2Jgd4_QxMdjj6Iee1hityZqhTxT6fpysfcCuS-AlOXPYRnv1ey7J6-PDy3pDd89P2_VqRxtR8JEaU9raAHesrtNkseBcmdzmpcS84MgqCaVzDRMqx7py3DCGxsocFAonuViS23nvO7b6EHyH4VsP6PVmtdPTWyqihFTqkyWWzWwThhiDdX8CAz2l1HPK5JR6Sqllcm5m54CxwdYF7Bsf_0UpZMlTzx-OVnYs</recordid><startdate>20061201</startdate><enddate>20061201</enddate><creator>CAMBAZARD, Hadrien</creator><creator>JUSSIEN, Narendra</creator><general>Springer</general><general>Springer Verlag</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope></search><sort><creationdate>20061201</creationdate><title>Identifying and exploiting problem structures using explanation-based constraint programming</title><author>CAMBAZARD, Hadrien ; JUSSIEN, Narendra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c352t-dd6ebd02f1bb6ebea5229d4e468a452a17806ffc1394ab7f2d11ade8409a3f823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Artificial Intelligence</topic><topic>Computer Science</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations Research</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CAMBAZARD, Hadrien</creatorcontrib><creatorcontrib>JUSSIEN, Narendra</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Constraints (Dordrecht)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>CAMBAZARD, Hadrien</au><au>JUSSIEN, Narendra</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Identifying and exploiting problem structures using explanation-based constraint programming</atitle><jtitle>Constraints (Dordrecht)</jtitle><date>2006-12-01</date><risdate>2006</risdate><volume>11</volume><issue>4</issue><spage>295</spage><epage>313</epage><pages>295-313</pages><issn>1383-7133</issn><eissn>1572-9354</eissn><coden>CNSTFT</coden><abstract>Identifying structures in a given combinatorial problem is often a key step for designing efficient search heuristics or for understanding the inherent complexity of the problem. Several Operations Research approaches apply decomposition or relaxation strategies upon such a structure identified within a given problem. The next step is to design algorithms that adaptively integrate that kind of information during search. We claim in this paper, inspired by previous work on impact-based search strategies for constraint programming, that using an explanation-based constraint solver may lead to collect invaluable information on the intimate dynamically revealed and static structures of a problem instance. Moreover, we discuss how dedicated OR solving strategies (such as Benders decomposition) could be adapted to constraint programming when specific relationships between variables are exhibited.</abstract><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/s10601-006-9002-8</doi><tpages>19</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1383-7133 |
| ispartof | Constraints (Dordrecht), 2006-12, Vol.11 (4), p.295-313 |
| issn | 1383-7133 1572-9354 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00293899v1 |
| source | SpringerNature Journals |
| subjects | Applied sciences Artificial Intelligence Computer Science Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Operations Research |
| title | Identifying and exploiting problem structures using explanation-based constraint programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T20%3A08%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Identifying%20and%20exploiting%20problem%20structures%20using%20explanation-based%20constraint%20programming&rft.jtitle=Constraints%20(Dordrecht)&rft.au=CAMBAZARD,%20Hadrien&rft.date=2006-12-01&rft.volume=11&rft.issue=4&rft.spage=295&rft.epage=313&rft.pages=295-313&rft.issn=1383-7133&rft.eissn=1572-9354&rft.coden=CNSTFT&rft_id=info:doi/10.1007/s10601-006-9002-8&rft_dat=%3Chal_cross%3Eoai_HAL_hal_00293899v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |