Sciweavers

    121 search results - page 5 / 25
    » An Efficient Parallel Algorithm for Solving the Knapsack Pro...
    Sort
    View
    ICAI
    2004
    140views Artificial Intelligence» more  ICAI 2004»
    An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
    13 years 8 months ago
    An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
    Download  faculty.cs.tamu.edu
    In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
    Linli He, Thomas R. Ioerger
    claim paper
    Read More »
    DNA
    2004
    Springer
    96views Bioinformatics» more  DNA 2004»
    Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
    14 years 23 days ago
    Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
    Download  bi.snu.ac.kr
    Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
    Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak...
    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 7 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 »
    EOR
    2002
    74views more  EOR 2002»
    Modeling multistage cutting stock problems
    13 years 7 months ago
    Modeling multistage cutting stock problems
    Download  www.math.tu-dresden.de
    In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
    Eugene J. Zak
    claim paper
    Read More »
    COR
    2007
    97views more  COR 2007»
    Two-stage general block patterns for the two-dimensional cutting problem
    13 years 7 months ago
    Two-stage general block patterns for the two-dimensional cutting problem
    Download  www.math.tu-dresden.de
    This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
    Yaodong Cui, Xianquan Zhang
    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.