An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems (Q2890462)

From MaRDI portal
Revision as of 19:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
scientific article

    Statements

    title
    An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems (English)
    0 references
    author
    R. N. Uma
    0 references
    Joel M. Wein
    0 references
    publication date
    8 June 2012
    0 references
    zbMATH DE Number
    6044604
    0 references
    zbMATH Keywords
    single-machine scheduling
    0 references
    linear programming
    0 references
    approximation algorithms
    0 references
    OpenAlex ID
    W2146321208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2890462&oldid=31255767"
    Powered by MediaWiki