Sciweavers

    192
    Voted
    SOICT
    2010
    146views Information Technology» more  SOICT 2010»
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    14 years 10 months ago
    Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
    Download  becool.info.ucl.ac.be
    Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
    Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
    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.