Sciweavers

    ORL
    2008
    87views more  ORL 2008»
    On-line scheduling with non-crossing constraints
    13 years 10 months ago
    On-line scheduling with non-crossing constraints
    Download  people.eng.unimelb.edu.au
    We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
    Lele Zhang, Kwanniti Khammuang, Andrew Wirth
    claim paper
    Read More »
    ORL
    2008
    106views more  ORL 2008»
    Computing shortest heterochromatic monotone routes
    13 years 11 months ago
    Computing shortest heterochromatic monotone routes
    Download  calli.matem.unam.mx
    José Miguel Díaz-Báñez...
    claim paper
    Read More »
    ORL
    2008
    115views more  ORL 2008»
    On the convergence of stochastic dual dynamic programming and related methods
    13 years 11 months ago
    On the convergence of stochastic dual dynamic programming and related methods
    Download  edoc.hu-berlin.de
    We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
    Andrew B. Philpott, Z. Guan
    claim paper
    Read More »
    ORL
    2008
    86views more  ORL 2008»
    Searching the k-change neighborhood for TSP is W[1]-hard
    13 years 11 months ago
    Searching the k-change neighborhood for TSP is W[1]-hard
    Download  www.cs.bme.hu
    We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
    Dániel Marx
    claim paper
    Read More »
    ORL
    2006
    64views more  ORL 2006»
    Optimal prices for finite capacity queueing systems
    13 years 11 months ago
    Optimal prices for finite capacity queueing systems
    Download  www.unc.edu
    We prove a lower bound on the optimal price for a fairly large class of blocking systems with general arrival and service processes, determine optimal price expressions for M/M/1/...
    Serhan Ziya, Hayriye Ayhan, Robert D. Foley
    claim paper
    Read More »
    ORL
    2006
    85views more  ORL 2006»
    A simple proof of diffusion approximations for LBFS re-entrant lines
    13 years 11 months ago
    A simple proof of diffusion approximations for LBFS re-entrant lines
    Download  madis1.iss.ac.cn
    For a re-entrant line operating under the last-buffer
    Jiankui Yang, J. G. Dai, Jian-Gong You, Hanqin Zha...
    claim paper
    Read More »
    ORL
    2006
    103views more  ORL 2006»
    Reduction tests for the prize-collecting Steiner problem
    13 years 11 months ago
    Reduction tests for the prize-collecting Steiner problem
    Download  www.optimization-online.org
    This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
    Eduardo Uchoa
    claim paper
    Read More »
    ORL
    2006
    92views more  ORL 2006»
    The k-level facility location game
    13 years 11 months ago
    The k-level facility location game
    Download  v8nu74s71s31g374r7ssn017uloss3c1vr3s.unbf.ca
    We propose a cost-sharing scheme for the k-level facility location game that is cross-monotonic, competitive, and 6-approximate cost recovery. This extends the recent result for t...
    Dachuan Xu, Donglei Du
    claim paper
    Read More »
    ORL
    2006
    84views more  ORL 2006»
    An M/M/1 retrial queue with unreliable server
    13 years 11 months ago
    An M/M/1 retrial queue with unreliable server
    Download  www.pitt.edu
    We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the s...
    Nathan P. Sherman, Jeffrey P. Kharoufeh
    claim paper
    Read More »
    ORL
    2006
    118views more  ORL 2006»
    On complexity of multistage stochastic programs
    13 years 11 months ago
    On complexity of multistage stochastic programs
    Download  www.optimization-online.org
    In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
    Alexander Shapiro
    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.