The routing open-shop problem on a network: complexity and approximation (Q2496075)

From MaRDI portal
Revision as of 08:20, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The routing open-shop problem on a network: complexity and approximation
scientific article

    Statements

    title
    The routing open-shop problem on a network: complexity and approximation (English)
    0 references
    author
    Igor Averbakh
    0 references
    Oded Berman
    0 references
    Ilya Chernykh
    0 references
    publication date
    30 June 2006
    0 references
    zbMATH DE Number
    5038012
    0 references
    zbMATH Keywords
    heuristics
    0 references
    scheduling
    0 references
    approximation
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2496075&oldid=26996546"
    Powered by MediaWiki