C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Lower and upper bounds for the Bin Packing Problem with Fragile Objects.
François Clautiaux
Mauro Dell'Amico
Manuel Iori
Ali Khanafer
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
upper and lower bounds
lagrangian relaxation
d objects
optimal solution
moving objects
np hard
data objects
valid inequalities
data mining
search algorithm
knapsack problem
bin packing