Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization

By (author)  , By (author) 

List price: US$459.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

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).
show more

Product details

  • Hardback | 2406 pages
  • 167.6 x 246.4 x 132.1mm | 3,787.54g
  • Dordrecht, Netherlands
  • English
  • 1998 ed.
  • 36 Illustrations, black and white; XXIV, 2406 p. 36 illus. In 3 volumes, not available separately.
  • 0792350197
  • 9780792350194

Table of contents

Volume 1: Preface. Mixed-Integer Nonlinear Optimization in Process Synthesis; C.S. Adjiman, et al. Approximate Algorithms and Heuristics for MAX-SAT; R. Battiti, M. Protasi. Connections between Nonlinear Programming and Discrete Optimization; F. Giannessi, F. Tardella. Interior Point Methods for Combinatorial Optimization; J.E. Mitchell, et al. Knapsack Problems; D. Pisinger, P. Toth. Fractional Combinatorial Optimization; T. Radzik. Reformulation-Linearization Techniques for Discrete Optimization Problems; H.D. Sherali, W.P. Adams. Groebner Bases in Integer Programming; R.R. Thomas. Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey; R.R. Vemuganti. Volume 2: Preface. Efficient Algorithms for Geometric Shortest Path Query Problems; D.Z. Chen. Computing Distances between Evolutionary Trees; B. DasGupta, et al. Combinatorial Optimization and Coalition Games; Xiaotie Deng. Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work; F.C. Harris, Jr. Resource Allocation Problems; N. Katoh, T. Ibaraki. Combinatorial Optimization in Clustering; B. Mirkin, I. Muchnik. The Graph Coloring Problem: A Bibliographic Survey; P.M. Pardalos, et al. Steiner Minimal Trees in E3: Theory, Algorithms, and Applications; J. MacGregor Smith. Dynamical System Approaches to Combinatorial Optimization; J. Starke, M. Schanz. On-Line Dominating Set Problems for Graphs; Wen-Guey Tzeng. Optimization Problems in Optical Networks; Peng-Jun Wan. Shortest Networks on Surfaces; Jia Feng Weng. Minimum Weight Triangulation; Yanfeng Xu. Optimization Applications in the Airline Industry; Gang Yu, Jian Yang.Author Index. Subject Index. Volume 3: Preface. Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics; D. Bertsimas, Yingyu Ye. A Review of Machine Scheduling: Complexity, Algorithms and Approximability; Bo Chen, et al. Routing and Topology Embedding in Lightwave Networks; Feng Cao. The Quadratic Assignment Problem; R.E. Burkard, et al. Algorithmic Aspects of Domination in Graphs; G.J. Chang. Selected Algorithmic Techniques for Parallel Optimization; R.C. Correa, et al. Multispace Search in Combinatorial Optimization; Jun Gu. The Equitable Coloring of Graphs; Ko-Wei Lih. Randomized Parallel Algorithms for Combinatorial Optimization; S. Rajasekaran, J.D.P. Rolim. Tabu Search; F. Glover, M. Laguna. Author Index. Subject Index. Author Index of Volumes 1 3. Subject Index of Volumes 1 3.
show more