Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
SIU
2002
favorite
Email
discuss
report
67
views
more
SIU 2002
»
A Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem
13 years 10 months ago
Download
www.dep.ufscar.br
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes
Reinaldo Morabito, Randal Farago
Real-time Traffic
Larger Rectangle ´Ä
|
Pallet Loading Problem
|
SIU 2002
|
Upper Bound
|
claim paper
Related Content
»
Lagrangean relaxation with clusters and column generation for the manufacturers pallet loa...
more »
Post Info
More Details (n/a)
Added
23 Dec 2010
Updated
23 Dec 2010
Type
Journal
Year
2002
Where
SIU
Authors
Reinaldo Morabito, Randal Farago
Comments
(0)
Researcher Info
SIU 2002 Study Group
Computer Vision