Pages that link to "Item:Q765355"
From MaRDI portal
The following pages link to A simple branching scheme for vertex coloring problems (Q765355):
Displaying 6 items.
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
