Pages that link to "Item:Q2741502"
From MaRDI portal
The following pages link to A polyhedral approach for graph coloring (Q2741502):
Displaying 32 items.
- Packing and partitioning orbitopes (Q925263) (← links)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- The distance polytope for the vertex coloring problem (Q1661874) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- Facets of the graph coloring polytope (Q1854776) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- Polyhedral results for the equitable coloring problem (Q2840701) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- A Game Theoretic Approach for Efficient Graph Coloring (Q3596717) (← links)
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes (Q4626305) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
- A Facility Coloring Problem in 1-D (Q5251636) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918552) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918669) (← links)
- Faster graph coloring in polynomial space (Q5920158) (← links)