Sciweavers

    48 search results - page 9 / 10
    » disopt 2008
    Sort
    View
    DISOPT
    2008
    89views more  DISOPT 2008»
    Group sequencing around a common due date
    13 years 5 months 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
    2006
    155views more  DISOPT 2006»
    Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
    13 years 5 months ago
    Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
    Download  pluto.mscc.huji.ac.il
    We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
    Dorit S. Hochbaum, Asaf Levin
    claim paper
    Read More »
    DISOPT
    2007
    93views more  DISOPT 2007»
    A feasibility pump heuristic for general mixed-integer problems
    13 years 5 months ago
    A feasibility pump heuristic for general mixed-integer problems
    Download  www.dei.unipd.it
    Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
    Livio Bertacco, Matteo Fischetti, Andrea Lodi
    claim paper
    Read More »
    DISOPT
    2007
    155views more  DISOPT 2007»
    Linear-programming design and analysis of fast algorithms for Max 2-CSP
    13 years 5 months ago
    Linear-programming design and analysis of fast algorithms for Max 2-CSP
    Download  people.maths.ox.ac.uk
    The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
    Alexander D. Scott, Gregory B. Sorkin
    claim paper
    Read More »
    DISOPT
    2008
    91views more  DISOPT 2008»
    Partition inequalities for capacitated survivable network design based on directed p-cycles
    13 years 5 months ago
    Partition inequalities for capacitated survivable network design based on directed p-cycles
    Download  www.ieor.berkeley.edu
    We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
    Alper Atamtürk, Deepak Rajan
    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.