Heuristics and lower bounds for the bin packing problem with conflicts.
Michel GendreauGilbert LaporteFrédéric SemetPublished in: Comput. Oper. Res. (2004)
Keyphrases
- lower bound
- set of randomly generated instances
- upper bound
- running times
- branch and bound
- branch and bound algorithm
- random instances
- np hard
- optimal solution
- objective function
- upper and lower bounds
- lower and upper bounds
- cooperative
- families of valid inequalities
- finding optimal solutions
- quadratic assignment problem
- conflict resolution
- lower bounding
- worst case analysis
- worst case
- sample complexity
- search strategies
- randomly generated problems
- search algorithm
- heuristic methods
- lagrangian relaxation
- max sat
- precedence constraints
- heuristic search