Weighted matching as a generic pruning technique applied to optimization constraints
From MaRDI portal
Publication:490152
DOI10.1007/S10479-014-1582-XzbMATH Open1303.90099OpenAlexW1976189882MaRDI QIDQ490152FDOQ490152
Authors: Radosław Cymer 
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
Recommendations
- Solving various weighted matching problems with constraints
- A new approach for weighted constraint satisfaction
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- Approximation algorithms for weighted matching
- Efficient algorithms for variants of weighted matching and assignment problems
- A weighted perfect matching with constraints on weights of its parts
- A simple approximation algorithm for the weighted matching problem
- The weighted matching approach to maximum cardinality matching
- A survey of heuristics for the weighted matching problem
constraint programmingNP-hard problemscost-based filteringgraph traversalsoptimization constraintsweighted matching
Cites Work
- Network flows. Theory, algorithms, and applications.
- Introduction to algorithms
- Title not available (Why is that?)
- Matching theory
- Introducing global constraints in CHIP
- Cost-based arc consistency for global cardinality constraints
- Title not available (Why is that?)
- 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
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A linear-time algorithm for a special case of disjoint set union
- The Weighted Spanning Tree Constraint Revisited
- Improved filtering for weighted circuit constraints
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- The traveling-salesman problem and minimum spanning trees: Part II
- Principles of Constraint Programming
- A Short Proof of the Factor Theorem for Finite Graphs
- Graph factors
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Gallai-Edmonds decomposition as a pruning technique
- Title not available (Why is that?)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- Title not available (Why is that?)
- Recent Advances in Constraints
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Cost based filtering for the constrained knapsack problem
- Solving various weighted matching problems with constraints
- Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen
- An analysis of alternative strategies for implementing matching algorithms
- Filtering Algorithms for the NValue Constraint
- Using constraint programming to solve the maximum clique problem
- Principles and Practice of Constraint Programming – CP 2004
Cited In (4)
This page was built for publication: Weighted matching as a generic pruning technique applied to optimization constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490152)
