Strong inequalities and a branch-and-price algorithm for the convex recoloring problem.
Manoel B. CampêloAlexandre S. FreirePhablo F. S. MouraJoel C. SoaresPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- times faster
- detection algorithm
- globally optimal
- preprocessing
- learning algorithm
- experimental evaluation
- cost function
- significant improvement
- dynamic programming
- k means
- objective function
- np hard
- neural network
- clustering method
- segmentation algorithm
- linear programming
- high accuracy
- worst case
- computational cost
- theoretical analysis
- optimal solution
- matching algorithm
- linear program
- probabilistic model
- convergence rate
- piecewise linear