A decade of combinatorial optimization

K.I. Aardal, S. Hoesel, van, J.K. Lenstra, L. Stougie

    Onderzoeksoutput: Boek/rapportRapportAcademic

    83 Downloads (Pure)


    This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial-time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization. Some of the more prominent software packages in these areas are mentioned. With respect to obtaining approximate solutions to NP-hard problems, we survey recent positive and negative results on polynomial-time approximability and summarize the advances in local search.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's10
    StatusGepubliceerd - 1997

    Publicatie series

    NaamMemorandum COSOR
    ISSN van geprinte versie0926-4493


    Duik in de onderzoeksthema's van 'A decade of combinatorial optimization'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit