ILP models and column generation for the minimum sum coloring problem
From MaRDI portal
(Redirected from Publication:1742227)
Recommendations
- A branch-and-price algorithm for the minimum sum coloring problem
- Exact solution of graph coloring problems via constraint programming and column generation
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- New algorithm for the sum coloring problem
- Lower bounds for the minimal sum coloring problem
Cites work
- A Column Generation Approach for Graph Coloring
- A memetic algorithm for the minimum sum coloring problem
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A survey on vertex coloring problems
- An effective heuristic algorithm for sum coloring of graphs
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Lower bounds for the minimal sum coloring problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- On a graph partition problem with application to VLSI layout
- On sum coloring of graphs
- On the cost-chromatic number of graphs
- Tight bounds on the chromatic sum of a connected graph
Cited in
(5)- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- A column-generation approach to the multiple knapsack problem with color constraints
- On a binary-encoded ILP coloring formulation
- A branch-and-price algorithm for the minimum sum coloring problem
This page was built for publication: ILP models and column generation for the minimum sum coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742227)
