Pages that link to "Item:Q2489906"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for graph coloring (Q2489906):
Displaying 16 items.
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
- (Q3475285) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- A Pruning Procedure for Exact Graph Coloring (Q4015385) (← links)
- A Column Generation Approach for Graph Coloring (Q4367049) (← links)
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
- A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← 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)
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring (Q6579767) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)
