Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost noncrossing flow problem on layered networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining a Minimum Spanning Tree with Disjunctive Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, trees and matchings under disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-KP modeling for the maximum-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transportation problem with exclusionary side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Linear Programming in Computational and Systems Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving upper bounds for the clique number by non-valid inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum cost perfect matching problem with conflict pair constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for minimum spanning trees under conflict constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution algorithms for the maximum flow problem with additional conflict constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning tree problem with conflict constraints and its variations / rank
 
Normal rank

Revision as of 16:47, 21 August 2024

scientific article; zbMATH DE number 7780096
Language Label Description Also known as
English
Maximum weight perfect matching problem with additional disjunctive conflict constraints
scientific article; zbMATH DE number 7780096

    Statements

    Maximum weight perfect matching problem with additional disjunctive conflict constraints (English)
    0 references
    0 references
    18 December 2023
    0 references
    branch-and-bound
    0 references
    conflict constraints
    0 references
    integer programming
    0 references
    maximum weight perfect matching
    0 references
    stable sets
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references