IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/49135.html
   My bibliography  Save this paper

BISON : a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Author

Listed:
  • Scholl, Armin
  • Klein, Robert
  • Jürgens, Christian

Abstract

No abstract is available for this item.

Suggested Citation

  • Scholl, Armin & Klein, Robert & Jürgens, Christian, 1996. "BISON : a fast hybrid procedure for exactly solving the one-dimensional bin packing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49135, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  • Handle: RePEc:dar:wpaper:49135
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/49135/
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    2. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    3. Fleszar, Krzysztof & Charalambous, Christoforos, 2011. "Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 176-184, April.
    4. Otto, Christian & Otto, Alena, 2014. "Multiple-source learning precedence graph concept for the automotive industry," European Journal of Operational Research, Elsevier, vol. 234(1), pages 253-265.
    5. Elhedhli, Samir, 2005. "Ranking lower bounds for the bin-packing problem," European Journal of Operational Research, Elsevier, vol. 160(1), pages 34-46, January.
    6. Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    7. Liao, Chung-Shou & Hsu, Chia-Hong, 2013. "New lower bounds for the three-dimensional orthogonal bin packing problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 244-252.
    8. repec:spr:annopr:v:242:y:2016:i:1:d:10.1007_s10479-015-1973-7 is not listed on IDEAS
    9. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    10. Holthaus, Oliver, 2002. "Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths," European Journal of Operational Research, Elsevier, vol. 141(2), pages 295-312, September.
    11. repec:pal:jorsoc:v:55:y:2004:i:7:d:10.1057_palgrave.jors.2601771 is not listed on IDEAS
    12. Kalantari, Joakim & Sternberg, Henrik, 2009. "Research Outlook on a Mixed Model Transportation Network," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 41, pages 62-79.
    13. Mohamed Maiza & Abdenour Labed & Mohammed Radjef, 2013. "Efficient algorithms for the offline variable sized bin-packing problem," Journal of Global Optimization, Springer, vol. 57(3), pages 1025-1038, November.
    14. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
    15. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    16. Becker, Christian & Scholl, Armin, 2009. "Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure," European Journal of Operational Research, Elsevier, vol. 199(2), pages 359-374, December.
    17. Christian Becker & Armin Scholl, 2008. "Balancing assembly lines with variable parallel workplaces: Problem definition, model and exact solution procedure," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 06/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
    18. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    19. Timo Gschwind & Stefan Irnich, 2014. "Dual Inequalities for Stabilized Column Generation Revisited," Working Papers 1407, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 23 Jul 2014.

    More about this item

    JEL classification:

    • C22 - Mathematical and Quantitative Methods - - Single Equation Models; Single Variables - - - Time-Series Models; Dynamic Quantile Regressions; Dynamic Treatment Effect Models; Diffusion Processes

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:dar:wpaper:49135. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dekanatssekretariat). General contact details of provider: http://edirc.repec.org/data/ivthdde.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.