Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
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
Login
Register
Home
Publications
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
Home
Publications
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:
MB
Marco A. Boschetti
Marco A. Boschetti
AM
Aristide Mingozzi
Aristide Mingozzi
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
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
Cited by 37 articles
Scroll to top