On the bin packing problem with a fixed number of object weights
- 16 August 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 181 (1), 117-126
- https://doi.org/10.1016/j.ejor.2006.06.016
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- An asymptotically exact algorithm for the high-multiplicity bin packing problemMathematical Programming, 2005
- Ranking lower bounds for the bin-packing problemEuropean Journal of Operational Research, 2005
- Exploiting orbits in symmetric ILPMathematical Programming, 2003
- Families of non-IRUP instances of the one-dimensional cutting stock problemDiscrete Applied Mathematics, 2002
- A Polynomial Algorithm for Multiprocessor Scheduling with Two Job LengthsMathematics of Operations Research, 2001
- New cases of the cutting stock problem having MIRUPMathematical Methods of Operations Research, 1998
- Worst-case analyses, linear programming and the bin-packing problemMathematical Programming, 1998
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problemOperations Research Letters, 1997
- The cutting stock problem and integer roundingMathematical Programming, 1985
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982