LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility.
Gleb BelovHeide RohlingPublished in: Oper. Res. (2013)
Keyphrases
- graph based algorithm
- preprocessing
- cost function
- worst case
- learning algorithm
- k means
- graph structure
- computational complexity
- np hard
- linear programming
- shortest path problem
- average case
- packing problem
- objective function
- segmentation algorithm
- detection algorithm
- error bounds
- probabilistic model
- lower and upper bounds
- social networks
- upper bound
- neural network
- particle swarm optimization
- dynamic programming
- similarity measure
- maximum flow
- randomized algorithm
- solution path