Login / Signup
A Storage Pattern-Based Heuristic Algorithm for Solving Instances of Hard28 Datasets for the Bin Packing Problem.
Joaquín Pérez
Rafael de la Rosa Flores
Hilda Castillo Zacatelco
Darnes Vilariño
Published in:
Computación y Sistemas (2018)
Keyphrases
</>
timetabling problem
lower bound
np complete problems
data storage
random instances
randomly generated
storage requirements
sat instances
stochastic local search
database
partial solutions
graph coloring
linear programming
benchmark datasets
storage and retrieval
sampling methods
np complete
bin packing
exact methods