Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/3395
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rossi R. | - |
dc.contributor.author | Tarim S.A. | - |
dc.contributor.author | Hnich B. | - |
dc.contributor.author | Prestwich S. | - |
dc.date.accessioned | 2023-06-16T14:58:01Z | - |
dc.date.available | 2023-06-16T14:58:01Z | - |
dc.date.issued | 2008 | - |
dc.identifier.isbn | 3540859578 | - |
dc.identifier.isbn | 9783540859574 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://doi.org/10.1007/978-3-540-85958-1_16 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14365/3395 | - |
dc.description | Association of Constraint Programming;Cork Constraint Computation Centre;ILOG;National ICT Australia;University of New South Wales | en_US |
dc.description | 14th International Conference on Principles and Practice of Constraint Programming, CP 2008 -- 14 September 2008 through 18 September 2008 -- Sydney, NSW -- 74255 | en_US |
dc.description.abstract | Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that do not lead to better solutions [7]. Stochastic Constraint Programming is a framework for modeling combinatorial optimization problems that involve uncertainty [9]. In this work, we show how to perform cost-based filtering for certain classes of stochastic constraint programs. Our approach is based on a set of known inequalities borrowed from Stochastic Programming - a branch of OR concerned with modeling and solving problems involving uncertainty. We discuss bound generation and cost-based domain filtering procedures for a well-known problem in the Stochastic Programming literature, the static stochastic knapsack problem. We also apply our technique to a stochastic sequencing problem. Our results clearly show the value of the proposed approach over a pure scenario-based Stochastic Constraint Programming formulation both in terms of explored nodes and run times. © 2008 Springer-Verlag Berlin Heidelberg. | en_US |
dc.description.sponsorship | 05/IN/I886; SOBAG-108K027; Science Foundation Ireland, SFI: 03/CE3/I405; Türkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK | en_US |
dc.description.sponsorship | S. Armagan Tarim and Brahim Hnich are supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Grant No. SOBAG-108K027. Roberto Rossi is supported by Science Foundation Ireland under Grant No. 03/CE3/I405 as part of the Centre for Telecommunications Value-Chain-Driven Research (CTVR) and Grant No. 05/IN/I886. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Combinatorial mathematics | en_US |
dc.subject | Combinatorial optimization | en_US |
dc.subject | Computer programming | en_US |
dc.subject | Constrained optimization | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Costs | en_US |
dc.subject | Integer programming | en_US |
dc.subject | Signal interference | en_US |
dc.subject | Stochastic programming | en_US |
dc.subject | Combinatorial optimization problems | en_US |
dc.subject | Constraint programmings | en_US |
dc.subject | Decision variables | en_US |
dc.subject | Domain filtering | en_US |
dc.subject | Run times | en_US |
dc.subject | Sequencing problems | en_US |
dc.subject | Stochastic constraints | en_US |
dc.subject | Stochastic knapsack problems | en_US |
dc.subject | Problem solving | en_US |
dc.title | Cost-Based Domain Filtering for Stochastic Constraint Programming | en_US |
dc.type | Conference Object | en_US |
dc.identifier.doi | 10.1007/978-3-540-85958-1_16 | - |
dc.identifier.scopus | 2-s2.0-56449097573 | - |
dc.authorscopusid | 35563636800 | - |
dc.authorscopusid | 6602458958 | - |
dc.authorscopusid | 7004234709 | - |
dc.identifier.volume | 5202 LNCS | en_US |
dc.identifier.startpage | 235 | en_US |
dc.identifier.endpage | 250 | en_US |
dc.identifier.wos | WOS:000260041200016 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q3 | - |
dc.identifier.wosquality | N/A | - |
item.openairetype | Conference Object | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.