Sciweavers

    6 search results - page 1 / 2
    » An improved typology of cutting and packing problems
    Sort
    View
    EOR
    2007
    110views more  EOR 2007»
    An improved typology of cutting and packing problems
    13 years 4 months ago
    An improved typology of cutting and packing problems
    Download  lamp.urz.uni-magdeburg.de
    Gerhard Wäscher, Heike Haußner, Holger ...
    claim paper
    Read More »
    CORR
    2004
    Springer
    113views Education» more  CORR 2004»
    A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
    13 years 4 months ago
    A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
    Download  www.math.tu-dresden.de
    Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
    Sándor P. Fekete, Jörg Schepers
    claim paper
    Read More »
    EOR
    2007
    104views more  EOR 2007»
    A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
    13 years 4 months ago
    A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
    Download  www.math.tu-dresden.de
    The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
    Roberto Baldacci, Marco A. Boschetti
    claim paper
    Read More »
    ICPR
    2008
    IEEE
    158views Computer Vision» more  ICPR 2008»
    Tailoring text for automatic layouting of newspaper pages
    14 years 5 months ago
    Tailoring text for automatic layouting of newspaper pages
    Download  www.dai-labor.de
    We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
    Leonhard Hennig, Thomas Strecker
    claim paper
    Read More »
    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    13 years 8 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    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.