Author : Ding-Zhu Du
Publisher : Springer Science & Business Media
Page : 395 pages
File Size : 35,78 MB
Release : 2006-08-18
Category : Business & Economics
ISBN : 0387238301
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Author : Gerard Cornuejols
Publisher : SIAM
Page : 140 pages
File Size : 28,16 MB
Release : 2001-01-01
Category : Mathematics
ISBN : 0898714818
New and elegant proofs of classical results and makes difficult results accessible.
Author : Vijay V. Vazirani
Publisher : Springer Science & Business Media
Page : 380 pages
File Size : 45,54 MB
Release : 2013-03-14
Category : Computers
ISBN : 3662045656
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
Author : Lap Chi Lau
Publisher : Cambridge University Press
Page : 255 pages
File Size : 33,4 MB
Release : 2011-04-18
Category : Computers
ISBN : 1139499394
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Author : Guntram Scheithauer
Publisher : Springer
Page : 429 pages
File Size : 37,4 MB
Release : 2017-10-20
Category : Business & Economics
ISBN : 3319644033
This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks.
Author : Torben Hagerup
Publisher : Springer Science & Business Media
Page : 517 pages
File Size : 30,75 MB
Release : 2004-06-22
Category : Computers
ISBN : 3540223398
This book constitutes the refereed proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, held in Humlebaek, Denmark in July 2004. The 40 revised full papers presented together with an invited paper and the abstract of an invited talk were carefully reviewed and selected from 121 submissions. The papers span the entire range of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, bioinformatics, combinatorics, sorting, searching, online algorithms, optimization, etc.
Author : Michel Goemans
Publisher : Springer
Page : 409 pages
File Size : 12,30 MB
Release : 2013-03-12
Category : Computers
ISBN : 3642366945
This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Author : Ming-Yang Kao
Publisher : Springer Science & Business Media
Page : 1200 pages
File Size : 45,51 MB
Release : 2008-08-06
Category : Computers
ISBN : 0387307702
One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
Author : Dorit S. Hochbaum
Publisher : Course Technology
Page : 632 pages
File Size : 14,33 MB
Release : 1997
Category : Computers
ISBN :
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.
Author : Maciej M. Sys?o
Publisher : Courier Corporation
Page : 564 pages
File Size : 10,49 MB
Release : 2006-01-01
Category : Computers
ISBN : 0486453537
Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics. Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.
