Weighted matching as a generic pruning technique applied to optimization constraints

Radosław Cymer ()

Annals of Operations Research, 2014, vol. 217, issue 1, 165-211

Abstract: We study the application of matching theory within a constraint programming framework. In this work we describe a filtering scheme based on weighted matchings. A first benefit of our pruning technique comes from the fact that it can be applied on various optimization constraints. In a number of important cases our method achieves domain consistency in polynomial time. A key feature in our implementation is the use of decomposition theory. The paper compares some of the optimization constraints reported in the literature and shows how they can be solved with the help of the weighted matching. Copyright Springer Science+Business Media New York 2014

Keywords: Weighted matching; Cost-based filtering; Optimization constraints; Constraint programming; Graph traversals; NP-hard problems (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-014-1582-x (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:217:y:2014:i:1:p:165-211:10.1007/s10479-014-1582-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-014-1582-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().