One-dimensional relaxations and LP bounds for orthogonal packing.
Gleb BelovVadim M. KartakHeide RohlingGuntram ScheithauerPublished in: Int. Trans. Oper. Res. (2009)
Keyphrases
- lower bound
- linear programming
- upper bound
- np hard
- stage stochastic programs
- linear program
- lp relaxation
- linear programming relaxation
- objective function
- optimal solution
- multi dimensional
- upper bounding
- worst case
- lower and upper bounds
- packing problem
- simplex method
- feasible solution
- lp norm
- tight bounds
- upper and lower bounds
- average case
- integer programming
- primal dual
- linear relaxation
- data sets
- asset liability management
- constant factor
- error bounds
- branch and bound
- graph cuts
- computational complexity
- learning algorithm
- neural network