Sciweavers

    DISOPT
    2008
    87views more  DISOPT 2008»
    A Branch and Price algorithm for the k-splittable maximum flow problem
    13 years 11 months ago
    A Branch and Price algorithm for the k-splittable maximum flow problem
    Download  limos.isima.fr
    Jérôme Truffot, Christophe Duhamel
    claim paper
    Read More »
    DISOPT
    2008
    89views more  DISOPT 2008»
    Group sequencing around a common due date
    14 years 55 min ago
    Group sequencing around a common due date
    Download  repository.lib.polyu.edu.hk
    The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
    T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
    claim paper
    Read More »
    DISOPT
    2008
    71views more  DISOPT 2008»
    The Grothendieck constant of random and pseudo-random graphs
    14 years 56 min ago
    The Grothendieck constant of random and pseudo-random graphs
    Download  www.cs.tau.ac.il
    Noga Alon, Eli Berger
    claim paper
    Read More »
    DISOPT
    2008
    99views more  DISOPT 2008»
    Computing robust basestock levels
    14 years 16 days ago
    Computing robust basestock levels
    Download  www.columbia.edu
    This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
    Daniel Bienstock, Nuri Özbay
    claim paper
    Read More »
    DISOPT
    2008
    89views more  DISOPT 2008»
    Complexity of the min-max (regret) versions of min cut problems
    14 years 16 days ago
    Complexity of the min-max (regret) versions of min cut problems
    Download  www.lamsade.dauphine.fr
    This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
    Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
    claim paper
    Read More »
    DISOPT
    2008
    107views more  DISOPT 2008»
    The k-path tree matroid and its applications to survivable network design
    14 years 16 days ago
    The k-path tree matroid and its applications to survivable network design
    Download  www.ams.sunysb.edu
    We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
    Esther M. Arkin, Refael Hassin
    claim paper
    Read More »
    DISOPT
    2008
    89views more  DISOPT 2008»
    A pricing problem under Monge property
    14 years 16 days ago
    A pricing problem under Monge property
    Download  www.cs.ust.hk
    We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
    Oktay Günlük
    claim paper
    Read More »
    DISOPT
    2008
    93views more  DISOPT 2008»
    Exploiting planarity in separation routines for the symmetric traveling salesman problem
    14 years 16 days ago
    Exploiting planarity in separation routines for the symmetric traveling salesman problem
    Download  www.lancs.ac.uk
    At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
    Adam N. Letchford, Nicholas A. Pearson
    claim paper
    Read More »
    DISOPT
    2008
    74views more  DISOPT 2008»
    George B. Dantzig and systems optimization
    14 years 16 days ago
    George B. Dantzig and systems optimization
    Download  www.stanford.edu
    We pay homage to George B. Dantzig by describing a less well known part of his legacy--his early and dedicated championship of the importance of systems optimization in solving co...
    Philip E. Gill, Walter Murray, Michael A. Saunders...
    claim paper
    Read More »
    DISOPT
    2008
    55views more  DISOPT 2008»
    A sequential elimination algorithm for computing bounds on the clique number of a graph
    14 years 16 days ago
    A sequential elimination algorithm for computing bounds on the clique number of a graph
    Download  www.gerad.ca
    Bernard Gendron, Alain Hertz, Patrick St-Louis
    claim paper
    Read More »
    123next ›last »
    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.