Analysis and Design of Algorithms for Combinatorial Problems

G. Ausiello et Mario Lucertini

ISBN 10: 0444876995 / ISBN 13: 9780444876997

Editore: Elsevier Science Ltd, 1985

Riguardo questo articolo

Ancien livre de bibliothèque. Traces d'usure sur la couverture. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations.

Codice articolo E-597-907

Dati bibliografici

• Titolo: Analysis and Design of Algorithms for Combinatorial Problems
• Editore: Elsevier Science Ltd
• Data di pubblicazione: 1985
• Lingua: Inglese
• ISBN 10: 0444876995
• ISBN 13: 9780444876997
• Rilegatura: Softcover
• Condizione: Bon

Descrizione articolo

Riassunto

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.