Analysis and Design of Algorithms for Combinatorial Problems

Kobo ebook | May 1, 1985

byAusiello, G.

not yet rated|write a review
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.

Pricing and Purchase Info

$73.79 online
$95.73 list price (save 22%)
Available for download
Not available in stores

From the Publisher

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 optimizati...

Format:Kobo ebookPublished:May 1, 1985Publisher:North HollandLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0080872204

ISBN - 13:9780080872209

Look for similar items by category:

Customer Reviews of Analysis and Design of Algorithms for Combinatorial Problems

Reviews