On the bin packing problem with a fixed number of object weights-Reference-Cited by-同舟云学术

On the bin packing problem with a fixed number of object weights

Published:2007-08 Issue:1 Volume:181 Page:117-126
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Filippi Carlo

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference15 articles.

1. D.L. Applegate, L.S. Buriol, B.L. Dillard, D.S. Johnson, P.W. Shor, The cutting-stock approach to bin packing: Theory and experiments, in: Proceedings of ALENEX03. SIAM, 2003.

2. Worst-case analyses, linear programming and the bin-packing problem;Mui Ann Chan;Mathematical Programming,1998

3. Fast integer programming in fixed dimension;Eisenbrand,2003

4. F. Eisenbrand, G. Shmonin, Carathéodory bounds for integer cones, Operations Research Letters, in press.

5. Ranking lower bounds for the bin-packing problem;Elhedhli;European Journal of Operational Research,2005

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Intelligent Loading Method of Air Containers for Air Express Transportation Based on Modular Assembling;The Proceedings of the 5th International Conference on Energy Storage and Intelligent Vehicles (ICEIV 2022);2023

2. Polynomiality for Bin Packing with a Constant Number of Item Types;Journal of the ACM;2020-11-16

3. Using Structural Properties for Integer Programs;Sailing Routes in the World of Computation;2018

4. A Polynomial TimeOPT+ 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths;Mathematics of Operations Research;2011-11

5. An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths;Integer Programming and Combinatorial Optimization;2010