Weighted matching as a generic pruning technique applied to optimization constraints (Q490152): Difference between revisions

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

Latest revision as of 13:49, 9 July 2024

scientific article
Language Label Description Also known as
English
Weighted matching as a generic pruning technique applied to optimization constraints
scientific article

    Statements

    Weighted matching as a generic pruning technique applied to optimization constraints (English)
    0 references
    0 references
    22 January 2015
    0 references
    weighted matching
    0 references
    cost-based filtering
    0 references
    optimization constraints
    0 references
    constraint programming
    0 references
    graph traversals
    0 references
    NP-hard problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers