Selected Topics In Discrete Mathematics Proceedings Of The Moscow Discrete Mathematics Seminar 1972 1990
Download Selected Topics In Discrete Mathematics Proceedings Of The Moscow Discrete Mathematics Seminar 1972 1990 PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Selected Topics In Discrete Mathematics Proceedings Of The Moscow Discrete Mathematics Seminar 1972 1990 book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Selected topics in discrete mathematics: Proceedings of the Moscow Discrete Mathematics Seminar, 1972-1990
Author: Alexander K. Kelmans
language: en
Publisher: American Mathematical Soc.
Release Date: 1994-02-18
This is a collection of translations of a variety of papers on discrete mathematics by members of the Moscow Seminar on Discrete Mathematics. This seminar, begun in 1972, was marked by active participation and intellectual ferment. Mathematicians in the USSR often encountered difficulties in publishing, so many interesting results in discrete mathematics remained unknown in the West for some years, and some are unknown even to the present day. To help fill this communication gap, this collection offers papers that were obscurely published and very hard to find. Among the topics covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory and submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.
Selected Topics in Discrete Mathematics
This is a collection of translations of a variety of papers on discrete mathematics by members of the Moscow Seminar on Discrete Mathematics. This seminar, begun in 1972, was marked by active participation and intellectual ferment. Mathematicians in the USSR often encountered difficulties in publishing, so many interesting results in discrete mathematics remained unknown in the West for some years, and some are unknown even to the present day. To help fill this communication gap, this collection offers papers that were obscurely published and very hard to find. Among the topics covered here ar.
Combinatorial Optimization
Author: Alexander Schrijver
language: en
Publisher: Springer Science & Business Media
Release Date: 2003-02-12
This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.