Sciweavers

    104
    Voted
    EOR
    2008
    91views more  EOR 2008»
    A branch-and-bound algorithm for the linear ordering problem with cumulative costs
    15 years 3 months ago
    A branch-and-bound algorithm for the linear ordering problem with cumulative costs
    Download  www.crema.unimi.it
    The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
    Giovanni Righini
    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.