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

@@ Property / cites work @@
+Symmetry in Integer Linear Programming
@@ Property / cites work: Symmetry in Integer Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Packing and partitioning orbitopes
@@ Property / cites work: Packing and partitioning orbitopes / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry
+Normal rank
@@ Property / cites work @@
+Pruning by isomorphism in branch-and-cut
@@ Property / cites work: Pruning by isomorphism in branch-and-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting orbits in symmetric ILP
@@ Property / cites work: Exploiting orbits in symmetric ILP / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric ILP: Coloring and small integers
@@ Property / cites work: Symmetric ILP: Coloring and small integers / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Orbital Branching
@@ Property / cites work: Constraint Orbital Branching / rank @@
+Normal rank
@@ Property / cites work @@
+Extended Formulations for Packing and Partitioning Orbitopes
+Normal rank
@@ Property / cites work @@
+Orbitopal Fixing
@@ Property / cites work: Orbitopal Fixing / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamental Domains for Integer Programs with Symmetries
+Normal rank
@@ Property / cites work @@
+A Column Generation Approach for Graph Coloring
@@ Property / cites work: A Column Generation Approach for Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+Polyhedral results for the bipartite induced subgraph problem
+Normal rank
@@ Property / cites work @@
+On the \(k\)-coloring of intervals
@@ Property / cites work: On the \(k\)-coloring of intervals / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Bipartization and via minimization
@@ Property / cites work: Graph Bipartization and via minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Q3347929
@@ Property / cites work: Q3347929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5685113
@@ Property / cites work: Q5685113 / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On perfectness of sums of graphs
@@ Property / cites work: On perfectness of sums of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum \(k\)-colorable subgraph problem and orbitopes
+Normal rank