Sciweavers

    NETWORKS
    2010
    321views Computer Networks» more  NETWORKS 2010»
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    13 years 10 months ago
    Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
    Download  www.euro-online.org
    Giulia Galbiati, Stefano Gualandi, Francesco Maffi...
    claim paper
    Read More »
    NETWORKS
    2010
    118views Computer Networks» more  NETWORKS 2010»
    Minimal selectors and fault tolerant networks
    13 years 10 months ago
    Minimal selectors and fault tolerant networks
    Download  algo.inria.fr
    Omid Amini, Frédéric Giroire, St&eac...
    claim paper
    Read More »
    NETWORKS
    2010
    125views Computer Networks» more  NETWORKS 2010»
    A polyhedral study of the network pricing problem with connected toll arcs
    13 years 10 months ago
    A polyhedral study of the network pricing problem with connected toll arcs
    Download  www.iro.umontreal.ca
    Géraldine Heilporn, Martine Labbé, P...
    claim paper
    Read More »
    NETWORKS
    2010
    112views Computer Networks» more  NETWORKS 2010»
    Almost sure asymptotic optimality for online routing and machine scheduling problems
    13 years 10 months ago
    Almost sure asymptotic optimality for online routing and machine scheduling problems
    Download  web.mit.edu
    Patrick Jaillet, Michael R. Wagner
    claim paper
    Read More »
    NETWORKS
    2010
    133views Computer Networks» more  NETWORKS 2010»
    Optimal permutation routing for low-dimensional hypercubes
    13 years 10 months ago
    Optimal permutation routing for low-dimensional hypercubes
    Download  www.cs.tufts.edu
    Ambrose Kofi Laing, David W. Krumme
    claim paper
    Read More »
    NETWORKS
    2010
    165views Computer Networks» more  NETWORKS 2010»
    Integrating facility location and production planning decisions
    13 years 10 months ago
    Integrating facility location and production planning decisions
    Download  www.ieor.berkeley.edu
    H. Edwin Romeijn, Thomas C. Sharkey, Zuo-Jun Max S...
    claim paper
    Read More »
    NETWORKS
    2010
    347views Computer Networks» more  NETWORKS 2010»
    A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
    13 years 10 months ago
    A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
    Download  www.cs.uwaterloo.ca
    In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
    Jean-François Cordeau, Manuel Iori, Gilbert...
    claim paper
    Read More »
    NETWORKS
    2010
    122views Computer Networks» more  NETWORKS 2010»
    k-Splittable delay constrained routing problem: A branch-and-price approach
    13 years 10 months ago
    k-Splittable delay constrained routing problem: A branch-and-price approach
    Download  www.isima.fr
    Jérôme Truffot, Christophe Duhamel, P...
    claim paper
    Read More »
    NETWORKS
    2010
    148views Computer Networks» more  NETWORKS 2010»
    Fixed-parameter tractability results for full-degree spanning tree and its dual
    13 years 10 months ago
    Fixed-parameter tractability results for full-degree spanning tree and its dual
    Download  theinf1.informatik.uni-jena.de
    We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
    Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    claim paper
    Read More »
    NETWORKS
    2010
    133views Computer Networks» more  NETWORKS 2010»
    Mixed search number and linear-width of interval and split graphs
    13 years 10 months ago
    Mixed search number and linear-width of interval and split graphs
    Download  www.ii.uib.no
    We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
    Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
    claim paper
    Read More »
    « first‹ previous…102103104105106107108109110…next ›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.