Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3150940 obálek a 950590 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Analysis and Design of Algorithms for Combinatorial Problems (North-Holland Mathematics Studies)
Rok: 1985
ISBN: 9780444876997
NKP-CNB: boa001-muni.000341387
OKCZID: 110353485
Citace (dle ČSN ISO 690):
AUSIELLO, G., ed. a LUCERTINI, M., ed. Analysis and design of algorithms for combinatorial problems. Amsterdam: North-Holland, 1985. 319 s. Annals of discrete mathematics, 25.
Anotace
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.