Pages that link to "Item:Q1029072"
From MaRDI portal
The following pages link to Cliques, holes and the vertex coloring polytope (Q1029072):
Displayed 13 items.
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← 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 Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← 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)