A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem.
Mehdi MradOlfa HarrabiJouhaina Chaouachi SialaAnis GharbiPublished in: IEEE Access (2020)
Keyphrases
- column generation
- lower bound
- branch and bound
- optimal solution
- upper bound
- branch and bound algorithm
- linear programming relaxation
- exact solution
- lagrangean relaxation
- lagrangian relaxation
- mixed integer programming
- integer linear programming
- vehicle routing
- np hard
- integer program
- linear programming
- vehicle routing problem with time windows
- set partitioning
- lower and upper bounds
- cutting plane
- objective function
- integer programming
- set covering
- linear program
- valid inequalities
- search algorithm
- linear programming problems
- cutting plane algorithm
- search space
- worst case
- dantzig wolfe decomposition
- cost function
- metaheuristic
- optimization problems