Login / Signup
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.
Marco A. Boschetti
Aristide Mingozzi
Published in:
4OR (2003)
Keyphrases
</>
lower bound
upper bound
lower and upper bounds
branch and bound algorithm
branch and bound
three dimensional
worst case
genetic algorithm
packing problem
objective function
multi dimensional
special case
optimal solution
np hard
lower bounding
machine learning
max sat
quadratic assignment problem
optimal cost