| # |
Title |
Authors |
Dim |
Abbrev |
Shape |
| 363 |
A hybrid heuristic for multiobjective knapsack problems |
Abdelaziz, F. B.; Krichen, S.; Chaouachi, J. |
1D |
SKP |
|
| 326 |
Interactive ILP Procedures for stacking optimization for the 3D palletization problem |
Abdou, G.; Arghavani, J. |
3D |
SLOPP |
|
| 597 |
Determining cutting stock patterns when defects are present |
Aboudi, R.; Barcia, P. |
|
|
|
| 317 |
Ein Verschnittproblem in der Holzindustrie |
Achatz, H.; Konrad, A. |
1D |
MSSCSP |
|
| 695 |
A client-broker-server architecture of a virtual enterprise for cutting stock applications |
Ahonen, H.; Alvarenga, A. G. et al |
2D |
ODP |
irregular |
| 926 |
Heuristic Solutions for the Mulitple-Choice Multi-dimension Knapsack Problem |
Akbar, M. M.; Manning, E. G.; Shoja, G. C.; Khan, S. |
2D |
SKP |
|
| 83 |
Average-Case Analyses of First Fit and Random Fit Bin Packing |
Albers, S.; Mitzenmacher, M. |
1D |
SBSBPP |
|
| 508 |
A tabu search algorithm for the pallet loading problem |
Alvares-Valdes, R.; Parreño, F.; Tamarit, J. M. |
2D |
IIPP |
regular |
| 876 |
A GRASP algorithm for constrained two dimensional non-guillotine cutting problems |
Alvares-Valdes, R.; Parreño, F.; Tamarit, J. M. |
2D |
SLOPP |
regular |
| 55 |
A tabu search algorithm for large-scale guillotine (un)constrainted two-dimensional cutting problems |
Alvarez-Valdés, R.; Parajón, A.; Tamarit, J. M. |
2D |
SLOPP |
regular |
| 440 |
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems |
Alvarez-Valdés, R.; Parajón, A.; Tamarit, J. M. |
2D |
MSSCSP |
regular |
| 624 |
FAFNER - Accelarating Nesting Problems with FPGAs |
Alves; J. C.; Ferreira, J. C. et al |
2D |
ODP |
irregular |
| 86 |
Local Search for the Bin Packing Problem |
Alvim, A. C. F.; Glover, F.; Ribeiro, C. C.; Aloise, D. J. |
1D |
SBSBPP |
|
| 88 |
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem |
Alvim, A. C. F.; Ribeiro, C. C.; Glover, F.; Aloise, D. J. |
1D |
SBSBPP |
|
| 269 |
Experiments with a strategic oscillation algorithm for the pallet loading problem |
Amaral, A. R. S.; Wright, M. |
2D |
IIPP |
regular |
| 696 |
Efficient Algorithm for the Constrained Two-dimensional Cutting Stock Problem |
Amaral, A. R. S.; Wright, W. |
2D |
SLOPP |
regular |
| 331 |
An Integrated Machine Vision Based System for Solving the Nonconvex Cutting Stock Problem Using Genetic Algorithms |
Anand, S.; McCord, C.; Sharma, R. |
2D |
SKP |
irregular |
| 25 |
Unbounded knapsack problem: Dynamic programming revisited |
Andonov, R.; Poirriez, V. ; Rajopadhye, S. |
1D |
SLOPP |
|
| 625 |
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming |
Antonio, J.; Chauvet, F. et al |
1D |
MSSCSP |
|
| 309 |
The Cutting-Stock Approach to Bin Packing: Theory and Experiments |
Applegate, D. L.; Buriol, L. S.; Dillard, B. L.; Johnson, D. S.; Shor, P. W. |
1D |
SBSBPP |
|
