eBook PDF Download Digital Library
Author: András Frank
Publisher: OUP Oxford
Published: 2011-02-24
Total Pages: 664
ISBN-13: 0199205272
DOWNLOAD EBOOK →Filling the gap between introductory and encyclopedic treatments, this book provides rich and appealing material for a second course in combinatorial optimization. This book is suitable for graduate students as well as a reference for established researchers.
Author: Eugene Lawler
Publisher: Courier Corporation
Published: 2012-10-16
Total Pages: 400
ISBN-13: 048614366X
DOWNLOAD EBOOK →Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
Author: Claudio Gentile
Publisher: Springer Nature
Published: 2021-03-01
Total Pages: 408
ISBN-13: 3030630722
DOWNLOAD EBOOK →This book highlights new and original contributions on Graph Theory and Combinatorial Optimization both from the theoretical point of view and from applications in all fields. The book chapters describe models and methods based on graphs, structural properties, discrete optimization, network optimization, mixed-integer programming, heuristics, meta-heuristics, math-heuristics, and exact methods as well as applications. The book collects selected contributions from the CTW2020 international conference (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization), held online on September 14-16, 2020. The conference was organized by IASI-CNR with the contribution of University of Roma Tre, University Roma Tor Vergata, and CNRS-LIX and with the support of AIRO. It is addressed to researchers, PhD students, and practitioners in the fields of Graph Theory, Discrete Mathematics, Combinatorial Optimization, and Operations Research.
Author: J. MacGregor Smith
Publisher: Springer Nature
Published: 2021-10-17
Total Pages: 275
ISBN-13: 303075801X
DOWNLOAD EBOOK →This textbook provides an introduction to the use and understanding of optimization and modeling for upper-level undergraduate students in engineering and mathematics. The formulation of optimization problems is founded through concepts and techniques from operations research: Combinatorial Optimization, Linear Programming, and Integer and Nonlinear Programming (COLIN). Computer Science (CS) is also relevant and important given the applications of algorithms and Apps/algorithms (A) in solving optimization problems. Each chapter provides an overview of the main concepts of optimization according to COLINA, providing examples through App Inventor and AMPL software applications. All apps developed through the text are available for download. Additionally, the text includes links to the University of Wisconsin NEOS server, designed to handle more computing-intensive problems in complex optimization. Readers are encouraged to have some background in calculus, linear algebra, and related mathematics.
Author: Bernhard Korte
Publisher: Springer Science & Business Media
Published: 2006-01-27
Total Pages: 596
ISBN-13: 3540292977
DOWNLOAD EBOOK →This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.
Author: Michael Z. Zgurovsky
Publisher: Springer
Published: 2018-09-24
Total Pages: 518
ISBN-13: 3319989774
DOWNLOAD EBOOK →The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.
Author: Maggie Xiaoyan Cheng
Publisher: Springer Science & Business Media
Published: 2006-07-02
Total Pages: 655
ISBN-13: 0387290265
DOWNLOAD EBOOK →This book gives a comprehensive presentation of cutting-edge research in communication networks with a combinatorial optimization component. The objective of the book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Each chapter is written by an expert dealing with theoretical, computational, or applied aspects of combinatorial optimization.
Author: Michael Jünger
Publisher: Springer Science & Business Media
Published: 2001-11-21
Total Pages: 317
ISBN-13: 3540428771
DOWNLOAD EBOOK →This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Author: Alexander Schrijver
Publisher: Springer Science & Business Media
Published: 2003-02-12
Total Pages: 2024
ISBN-13: 9783540443896
DOWNLOAD EBOOK →From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum
Author: Vangelis Th. Paschos
Publisher: John Wiley & Sons
Published: 2014-09-15
Total Pages: 450
ISBN-13: 1848216580
DOWNLOAD EBOOK →Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
