An approximation algorithm for the partial covering 0-1 integer program.
Yotaro TakazawaShinji MizunoTomonari KitaharaPublished in: Discret. Appl. Math. (2020)
Keyphrases
- learning algorithm
- integer program
- linear programming
- k means
- cost function
- computational complexity
- approximation ratio
- error bounds
- optimization algorithm
- theoretical analysis
- simulated annealing
- np hard
- computational cost
- objective function
- optimal solution
- dynamic programming
- neural network
- particle swarm optimization
- linear programming relaxation
- constraint satisfaction
- convex hull
- approximation algorithms
- matching algorithm
- knapsack problem
- preprocessing
- search space
- segmentation algorithm
- probabilistic model