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.
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
Rok: 2001
ISBN: 9783540428770
OKCZID: 110063472
Citace (dle ČSN ISO 690):
JÜNGER, Michael, ed. a NADDEF, Denis, ed. Computational combinatorial optimization: optimal of provably near-optimal solutions. Berlin: Springer, 2001. VIII, 303 s. Lecture notes in computer science, 2241.
Anotace
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.