Sciweavers

    12 search results - page 3 / 3
    » MPQ-trees for orthogonal packing problem
    Sort
    View
    TAMC
    2007
    Springer
    161views Applied Computing» more  TAMC 2007»
    Approximation Algorithms for 3D Orthogonal Knapsack
    13 years 11 months ago
    Approximation Algorithms for 3D Orthogonal Knapsack
    Download  www.informatik.uni-kiel.de
    We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
    Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
    claim paper
    Read More »
    EOR
    2007
    88views more  EOR 2007»
    The minimum size instance of a Pallet Loading Problem equivalence class
    13 years 5 months ago
    The minimum size instance of a Pallet Loading Problem equivalence class
    Download  faculty.nps.edu
    The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
    Gustavo H. A. Martins, Robert F. Dell
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.