# krainaksiazek gems of combinatorial optimization and graph algorithms 20123740

- znaleziono 7 produktów w 3 sklepach

### The Handbook Of Graph Theory, Combinatorial Optimization, And Algorithms

**Książki Obcojęzyczne>Angielskie>Mathematics & science>Mathematics>Combinatorics & graph theory**

Sklep: Gigant.pl

### The Handbook Of Graph Theory, Combinatorial Optimization, And Algorithms

**Książki Obcojęzyczne>Angielskie>Mathematics & science>Mathematics>Combinatorics & graph theory**

0x007badce00000000

Sklep: Gigant.pl

### Handbook of Graph Theory, Combinatorial Optimization, and Algorithms Taylor & Francis Inc

**Książki / Literatura obcojęzyczna**

Sklep: Libristo.pl

### Combinatorial Optimization and Graph Algorithms: Communications of Nii Shonan Meetings

**Książki**

Sklep: KrainaKsiazek.pl

### Handbook of Combinatorial Optimization Springer, Berlin

**Książki / Literatura obcojęzyczna**

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Sklep: Libristo.pl

### A Guide to Graph Colouring Springer, Berlin

**Książki / Literatura obcojęzyczna**

This book addresses the graph colouring problem, focusing on state-of-the-art algorithms, and looking at how related structures can be exploited to produce high-performance heuristics algorithms. Topics and applications covered include operations research, metaheuristics, combinatorial optimization, and scheduling. The book will be of interest to researchers and graduate students in the areas of operations research, theoretical computer science, optimization, and computational intelligence.

Sklep: Libristo.pl

### Ramsey Theory John Wiley & Sons Inc

**Książki / Literatura obcojęzyczna**

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development of this field. A complete listing of the titles in the Series appears on the inside front cover of this book. "[Integer and Combinatorial Optimization] is a major contribution to the literature of discrete programming. This text should be required reading for anybody who intends to research this area or even just to keep abreast of developments." --Times Higher Education Supplement, London "An extensive but extremely well-written graduate text covering integer programming." --American Mathematical Monthly Recent titles in the Series include: Integer and Combinatorial Optimization George L. Nemhauser and Laurence A. Wolsey 1988 (0 471-82819-X) 763 pp. Introduction to the Theory of Error-Correcting Codes Second Edition Vera Pless For mathematicians, engineers, and computer scientists, here is an introduction to the theory of error-correcting codes, focusing on linear block codes. The book considers such codes as Hamming and Golay codes, correction of double errors, use of finite fields, cyclic codes, B.C.H. codes, weight distributions, and design of codes. In a second edition of the book, Pless offers thoroughly expanded coverage of nonbinary and cyclic codes. Some proofs have been simplified, and there are many more examples and problems. 1989 (0 471-61884-5) 224 pp.

Sklep: Libristo.pl

Sklepy zlokalizowane w miastach: Warszawa, Kraków, Łódź, Wrocław, Poznań, Gdańsk, Szczecin, Bydgoszcz, Lublin, Katowice

# Szukaj w sklepach lub całym serwisie

## 1. Sklepy z krainaksiazek pl gems of combinatorial optimization and graph algorithms 20123740

2. Szukaj na wszystkich stronach serwisu

t1=0.03, t2=0, t3=0, t4=0, t=0.03