Fast lifting procedures for the bin packing problem-Reference-Cited by-同舟云学术

Fast lifting procedures for the bin packing problem

Published:2005-09 Issue:3 Volume:2 Page:201-218
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Haouari Mohamed,Gharbi Anis

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference16 articles.

1. A. Alvim, F. Glover, C. Ribeiro, D. Aloise, A hybrid improvement heuristic for the bin packing problem, Proceedings of MIC 2001—4th Metaheuristics International Conference, 2001, pp. 63–68.

2. An improved lower bound for the bin packing problem;Chen;Discrete Appl. Math.,1996

3. Approximation algorithms for bin packing: a survey;Coffman,1997

4. Optimal scheduling of tasks on identical parallel processors;Dell’Amico;ORSA J. Comput.,1995

5. Ranking lower bounds for the bin packing problem;Elhedhli;European J. Oper. Res.,2005

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

1. An optimal solution for the budgets assignment problem;RAIRO - Operations Research;2021-03

2. One-Dimensional Bin Packing;Introduction to Cutting and Packing Optimization;2017-10-24

3. Bin packing and cutting stock problems: Mathematical models and exact algorithms;European Journal of Operational Research;2016-11

4. Procedures for the bin packing problem with precedence constraints;European Journal of Operational Research;2016-05

5. New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows;Integration of AI and OR Techniques in Constraint Programming;2014