Handbook of Combinatorial Optimization
Title | Handbook of Combinatorial Optimization PDF eBook |
Author | Ding-Zhu Du |
Publisher | Springer Science & Business Media |
Pages | 395 |
Release | 2006-08-18 |
Genre | 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.
Handbook of combinatorial optimization. 1
Title | Handbook of combinatorial optimization. 1 PDF eBook |
Author | Dingzhu Du |
Publisher | Springer Science & Business Media |
Pages | 808 |
Release | 1998 |
Genre | Mathematics |
ISBN | 9780792350187 |
The first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems.
Handbook of Combinatorial Optimization
Title | Handbook of Combinatorial Optimization PDF eBook |
Author | Ding-Zhu Du |
Publisher | Springer Science & Business Media |
Pages | 650 |
Release | 2013-03-14 |
Genre | Mathematics |
ISBN | 1475730233 |
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).
Handbook of Combinatorics
Title | Handbook of Combinatorics PDF eBook |
Author | R.L. Graham |
Publisher | Elsevier |
Pages | 1283 |
Release | 1995-12-11 |
Genre | Business & Economics |
ISBN | 044488002X |
Combinatorial Optimization
Title | Combinatorial Optimization PDF eBook |
Author | Christos H. Papadimitriou |
Publisher | Courier Corporation |
Pages | 530 |
Release | 2013-04-26 |
Genre | Mathematics |
ISBN | 0486320138 |
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Title | Handbook of Graph Theory, Combinatorial Optimization, and Algorithms PDF eBook |
Author | Krishnaiyan "KT" Thulasiraman |
Publisher | CRC Press |
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
Combinatorial Optimization
Title | Combinatorial Optimization PDF eBook |
Author | Alexander Schrijver |
Publisher | Springer Science & Business Media |
Pages | 2024 |
Release | 2003-02-12 |
Genre | Business & Economics |
ISBN | 9783540443896 |
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