Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Cláudio AlvesJosé M. Valério de CarvalhoFrançois ClautiauxJürgen RietzPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- lower bound
- packing problem
- dual feasible
- upper bound
- branch and bound
- branch and bound algorithm
- bin packing
- worst case
- np hard
- integer programming
- optimal solution
- arbitrary shaped
- linear programming
- objective function
- projection operator
- combinatorial optimization
- image processing
- vc dimension
- linear programming relaxation
- query processing
- cutting plane