Weighted matching as a generic pruning technique applied to optimization constraints

DOI10.1007/s10479-014-1582-xzbMath1303.90099OpenAlexW1976189882MaRDI QIDQ490152

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1582-x

zbMATH Keywords

constraint programming NP-hard problems cost-based filtering graph traversals optimization constraints weighted matching

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Gallai-Edmonds decomposition as a pruning technique
Improved filtering for weighted circuit constraints
Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
A linear-time algorithm for a special case of disjoint set union
Matching theory
Graph factors
Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
Introducing global constraints in CHIP
Cost based filtering for the constrained knapsack problem
Cost-based arc consistency for global cardinality constraints
Solving various weighted matching problems with constraints
Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
Principles of Constraint Programming
The Weighted Spanning Tree Constraint Revisited
An analysis of alternative strategies for implementing matching algorithms
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
Faster scaling algorithms for general graph matching problems
Faster Scaling Algorithms for Network Problems
Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
Filtering Algorithms for the NValue Constraint
The Traveling-Salesman Problem and Minimum Spanning Trees
The traveling-salesman problem and minimum spanning trees: Part II
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Short Proof of the Factor Theorem for Finite Graphs
Principles and Practice of Constraint Programming – CP 2003
Recent Advances in Constraints
Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Weighted matching as a generic pruning technique applied to optimization constraints