Sciweavers

    10 search results - page 1 / 2
    » A note on the approximability of cutting stock problems
    Sort
    View
    EOR
    2007
    81views more  EOR 2007»
    A note on the approximability of cutting stock problems
    13 years 7 months ago
    A note on the approximability of cutting stock problems
    Download  www.ic.unicamp.br
    G. F. Cintra, Flávio Keidi Miyazawa, Yoshik...
    claim paper
    Read More »
    COLOGNETWENTE
    2008
    102views Optimization» more  COLOGNETWENTE 2008»
    A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs
    13 years 8 months ago
    A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs
    Download  ctw08.dti.unimi.it
    Alessandro Aloisio, Claudio Arbib, Fabrizio Marine...
    claim paper
    Read More »
    EOR
    2007
    90views more  EOR 2007»
    Accelerating column generation for variable sized bin-packing problems
    13 years 7 months ago
    Accelerating column generation for variable sized bin-packing problems
    Download  www.math.tu-dresden.de
    In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
    Cláudio Alves, José M. Valéri...
    claim paper
    Read More »
    ECCC
    2000
    93views more  ECCC 2000»
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    13 years 7 months ago
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    Download  reference.kfupm.edu.sa
    We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
    Uriel Feige, Marek Karpinski, Michael Langberg
    claim paper
    Read More »
    ORL
    2006
    105views more  ORL 2006»
    Inventory placement in acyclic supply chain networks
    13 years 7 months ago
    Inventory placement in acyclic supply chain networks
    Download  www.bschool.nus.edu.sg
    The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
    Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
    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.