Login / Signup
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem.
Mhand Hifi
Stéphane Nègre
Lei Wu
Published in:
Int. Trans. Oper. Res. (2014)
Keyphrases
</>
linear programming
variable sized
greedy heuristics
three dimensional
scheduling problem
computational complexity
linear program
data mining
lower bound
dynamic programming
integer programming
small size