ENGLISH

Analysis and Design of Algorithms for Combinatorial Problems

By G. Ausiello

Book information

Publisher
Elsevier, Academic Press
Year
1985
ISBN
0444876995, 9780444876997, 9780080872209
ISSN
0167-5060
LCC
QA164 .A49 1985
Language
english
Format
PDF
Filesize
6 MB (6141822 bytes)
Series
North-Holland Mathematics Studies 109 / Annals of Discrete Mathematics 25
Pages
335\335
Scanned
yes
Time added
2011-06-04 13:46:07

Description

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.

Similar books