Pages that link to "Item:Q1029072"

The following pages link to Cliques, holes and the vertex coloring polytope (Q1029072):

Displaying 32 items.

• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
• A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Integer linear programming formulations of the filter partitioning minimization problem (Q782755) (← links)
• Packing and partitioning orbitopes (Q925263) (← links)
• Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
• The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
• On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
• A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
• A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561) (← links)
• A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
• Clique-connecting forest and stable set polytopes (Q5189884) (← links)
• On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)