Sciweavers

    119
    Voted
    NETWORKS
    2008
    131views Computer Networks» more  NETWORKS 2008»
    Lagrangian relaxation and enumeration for solving constrained shortest-path problems
    15 years 2 months ago
    Lagrangian relaxation and enumeration for solving constrained shortest-path problems
    Download  www.nps.navy.mil
    Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
    W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.