New heuristics for one-dimensional bin-packing
- 30 June 2002
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 29 (7), 821-839
- https://doi.org/10.1016/s0305-0548(00)00082-4
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational AnalysisPublished by Springer Science and Business Media LLC ,1999
- An Introduction to Variable Neighborhood SearchPublished by Springer Science and Business Media LLC ,1999
- A new heuristic algorithm for the one-dimensional bin-packing problemProduction Planning & Control, 1999
- Exact solution of bin‐packing problems using column generation and branch‐and‐boundAnnals of Operations Research, 1999
- New Classes of Lower Bounds for Bin Packing ProblemsLecture Notes in Computer Science, 1998
- Variable neighborhood searchComputers & Operations Research, 1997
- Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problemComputers & Operations Research, 1997
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Assembly Line Balancing with a Precedence MatrixManagement Science, 1963