C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
New lower bounds for bin packing problems with conflicts.
Ali Khanafer
François Clautiaux
El-Ghazali Talbi
Published in:
Eur. J. Oper. Res. (2010)
Keyphrases
</>
packing problem
lower bound
cutting stock
upper bound
bin packing
branch and bound
integer programming
np hard
objective function
lot sizing
lower and upper bounds
branch and bound algorithm
conflict resolution
resolving conflicts
worst case
dc programming
optimal solution
vc dimension