Discover millions of ebooks, audiobooks, and so much more with a free trial

Only $11.99/month after trial. Cancel anytime.

Analysis and Design of Algorithms for Combinatorial Problems
Analysis and Design of Algorithms for Combinatorial Problems
Analysis and Design of Algorithms for Combinatorial Problems
Ebook317 pages4 hours

Analysis and Design of Algorithms for Combinatorial Problems

Rating: 0 out of 5 stars

()

Read preview

About this ebook

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed.

The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

LanguageEnglish
Release dateMay 1, 1985
ISBN9780080872209
Analysis and Design of Algorithms for Combinatorial Problems

Related to Analysis and Design of Algorithms for Combinatorial Problems

Titles in the series (43)

View More

Related ebooks

Mathematics For You

View More

Related articles

Reviews for Analysis and Design of Algorithms for Combinatorial Problems

Rating: 0 out of 5 stars
0 ratings

0 ratings0 reviews

What did you think?

Tap to rate

Review must be at least 10 words

    Book preview

    Analysis and Design of Algorithms for Combinatorial Problems - Elsevier Science

    Enjoying the preview?
    Page 1 of 1