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 3153082 obálek a 950729 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics)
Rok: 1987
ISBN: 9780898714814
OKCZID: 110454738
Citace (dle ČSN ISO 690):
CORNUEJOLS, Gerard. Combinatorial optimization: packing and covering. Philadelphia: Society for Industrial and Applied Mathematics, c2001. xi, 132 p. CBMS-NSF regional conference series in applied mathematics, 74.
Anotace
This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.