Pages that link to "Item:Q1022440"
From MaRDI portal
The following pages link to The vertex coloring problem and its generalizations (Q1022440):
Displaying 13 items.
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
- Algorithms for some graph theoretical optimization problems (abstract of thesis) (Q862821) (← links)
- Multicast problems in telecommunication networks (Q1022443) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Graph coloring-based approach for railway station design analysis and capacity determination (Q2189952) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- On properly ordered coloring of vertices in a vertex-weighted graph (Q2665834) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
