Faster width-dependent algorithm for mixed packing and covering LPs.
Digvijay BoobSaurabh SawlaniDi WangPublished in: NeurIPS (2019)
Keyphrases
- particle swarm optimization
- objective function
- learning algorithm
- segmentation algorithm
- computational complexity
- preprocessing
- packing problem
- k means
- improved algorithm
- times faster
- experimental evaluation
- dynamic programming
- detection algorithm
- optimization algorithm
- path planning
- worst case
- np hard
- data sets
- optimal solution
- selection algorithm
- estimation algorithm
- segmentation method
- single pass
- ant colony optimization
- memory efficient
- experimental study
- expectation maximization
- simulated annealing
- high accuracy
- hidden markov models
- cost function
- multi objective
- significant improvement
- search space
- artificial neural networks
- search algorithm