An Approximation Algorithm for Covering Linear Programs and its Application to Bin-Packing.
Eklavya SharmaPublished in: CoRR (2020)
Keyphrases
- bin packing
- linear program
- linear programming
- dynamic programming
- objective function
- computational complexity
- optimal solution
- learning algorithm
- strongly polynomial
- mixed integer
- search strategy
- particle swarm optimization
- extreme points
- graph colouring
- np hard
- linear programming problems
- simplex method
- nelder mead
- primal dual
- search space
- randomly generated
- convex hull
- combinatorial optimization
- simulated annealing
- worst case
- data structure