Research Trends in Combinatorial Optimization

Research Trends in Combinatorial Optimization
Author: William J. Cook
Publisher: Springer Science & Business Media
Total Pages: 565
Release: 2008-11-07
Genre: Mathematics
ISBN: 3540767967

The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3–7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Author: Krishnaiyan "KT" Thulasiraman
Publisher: CRC Press
Total Pages: 1217
Release: 2016-01-05
Genre: Computers
ISBN: 1420011073

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c

Integer Programming and Combinatorial Optimization

Integer Programming and Combinatorial Optimization
Author: Andrea Lodi
Publisher: Springer
Total Pages: 486
Release: 2008-05-24
Genre: Computers
ISBN: 3540688919

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.

More Sets, Graphs and Numbers

More Sets, Graphs and Numbers
Author: Ervin Gyori
Publisher: Springer Science & Business Media
Total Pages: 399
Release: 2010-10-02
Genre: Mathematics
ISBN: 3540324399

This volume honours the eminent mathematicians Vera Sos and Andras Hajnal. The book includes survey articles reviewing classical theorems, as well as new, state-of-the-art results. Also presented are cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers are sure to inspire further research.

Handbook of Approximation Algorithms and Metaheuristics

Handbook of Approximation Algorithms and Metaheuristics
Author: Teofilo F. Gonzalez
Publisher: CRC Press
Total Pages: 1434
Release: 2007-05-15
Genre: Computers
ISBN: 1420010743

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics. Starting with basic approaches, the handbook presents the methodologies to design and analyze efficient approximation algorithms for a large class of problems, and to establish inapproximability results for another class of problems. It also discusses local search, neural networks, and metaheuristics, as well as multiobjective problems, sensitivity analysis, and stability. After laying this foundation, the book applies the methodologies to classical problems in combinatorial optimization, computational geometry, and graph problems. In addition, it explores large-scale and emerging applications in networks, bioinformatics, VLSI, game theory, and data analysis. Undoubtedly sparking further developments in the field, this handbook provides the essential techniques to apply approximation algorithms and metaheuristics to a wide range of problems in computer science, operations research, computer engineering, and economics. Armed with this information, researchers can design and analyze efficient algorithms to generate near-optimal solutions for a wide range of computational intractable problems.

Submodular Functions and Optimization

Submodular Functions and Optimization
Author: Satoru Fujishige
Publisher: Elsevier
Total Pages: 411
Release: 2005-07-26
Genre: Mathematics
ISBN: 008046162X

It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics. - Self-contained exposition of the theory of submodular functions - Selected up-to-date materials substantial to future developments - Polyhedral description of Discrete Convex Analysis - Full description of submodular function minimization algorithms - Effective insertion of figures - Useful in applied mathematics, operations research, computer science, and economics

Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition

Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition
Author:
Publisher: ScholarlyEditions
Total Pages: 1039
Release: 2013-05-01
Genre: Mathematics
ISBN: 1490107509

Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition is a ScholarlyEditions™ book that delivers timely, authoritative, and comprehensive information about Approximation Theory. The editors have built Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Approximation Theory in this book to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

Digraphs

Digraphs
Author: Jørgen Bang-Jensen
Publisher: Springer Science & Business Media
Total Pages: 795
Release: 2008-12-17
Genre: Mathematics
ISBN: 1848009984

Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.

Automata, Languages and Programming

Automata, Languages and Programming
Author: Michele Bugliesi
Publisher: Springer Science & Business Media
Total Pages: 752
Release: 2006-06-30
Genre: Computers
ISBN: 3540359044

The two-volume set LNCS 4051 and LNCS 4052 constitutes the refereed proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, held in Venice, Italy, July 2006. In all, these volumes present more 100 papers and lectures. Volume I (4051) presents 61 revised full papers together with 1 invited lecture, focusing on algorithms, automata, complexity and games, on topics including graph theory, quantum computing, and more.

Handbook of Graph Theory

Handbook of Graph Theory
Author: Jonathan L. Gross
Publisher: CRC Press
Total Pages: 1200
Release: 2003-12-29
Genre: Computers
ISBN: 9780203490204

The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approach