Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
  1. Home
  2. Publications
  3. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case

The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case

Authors:
  • MBMarco A. Boschetti
    Marco A. Boschetti
  • AMAristide Mingozzi
    Aristide Mingozzi

Publisher website
Google Scholar
  • 1 March 2003
    • journal article
    • Published by Springer Nature in 4OR
    • Vol. 1  (1) , 27-42
    • DOI:10.1007/s10288-002-0005-z
Abstract
No abstract available
Keywords
  • LOWER BOUNDS
  • CUTTING AND PACKING
  • COMBINATORIAL OPTIMIZATION
  • BIN PACKING PROBLEM
  • HEURISTIC ALGORITHM
  • LOWER BOUND
Cited by 37 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.