//-->
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
Gonçalves, José Fernando, (2020)
Two-dimensional cutting stock problem with sequence dependent setup times
Wuttke, David A., (2018)
Two heuristics for the one-dimensional bin-packing problem
Singh, Alok, (2007)
Case analysis I, Panth Transport Limited, digitizing bulk logistics
Alok Singh, (2021)
Two multi-start heuristics for the k-traveling salesman problem
Pandiri, Venkatesh, (2020)