Pages that link to "Item:Q1015318"
From MaRDI portal
The following pages link to Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318):
Displaying 16 items.
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← 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)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Branch-and-Cut-and-Price algorithms for the preemptive RCPSP (Q4553884) (← links)
- Geodesic packing in graphs (Q6095044) (← links)
