The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086628398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and partitioning orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning by isomorphism in branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric ILP: Coloring and small integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Orbital Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations for Packing and Partitioning Orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal Fixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental Domains for Integer Programs with Symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the bipartite induced subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bipartization and via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfectness of sums of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum \(k\)-colorable subgraph problem and orbitopes / rank
 
Normal rank

Latest revision as of 23:01, 4 July 2024

scientific article
Language Label Description Also known as
English
The maximum \(k\)-colorable subgraph problem and orbitopes
scientific article

    Statements

    The maximum \(k\)-colorable subgraph problem and orbitopes (English)
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    symmetry breaking
    0 references
    graph coloring
    0 references

    Identifiers