Handbook of combinatorial optimization, Volume 2

Front Cover
Springer Science & Business Media, Dec 15, 1998 - Science - 2403 pages
0 Reviews
This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Contents
38
Computing the SubtreeTransfer Distance
53
The Rotation Distance
65
Combinatorial Optimization and Coalition Games
77
An Introduction
105
Extraction of the Correct Answer
127
Future Work
149
Resource Allocation Problems
159
Steiner Minimal Trees in
397
Contents
399
Heuristics
427
Applications
441
Dynamical System Approaches
471
Online Dominating Set Problems for Graphs
525
Optimization Problems in Optical Networks
543
Shortest Networks on Surfaces
589

Proximity Theorems
197
Lower Bounds on Time Complexity and Improved Algorithms
209
Introduction
225
Further Topics
239
Combinatoral Optimization in Clustering
261
A Bibliographic Survey
331
Minimum Weight Triangulations
617
Optimization Applications in the Airline Industry
635
Author Index
727
Subject Index
749
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 1 - Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA, E-mail: {chen,odaescu}<Dcse.

References to this book

About the author (1998)

Panos M. Pardalos is one of the leading experts in global optimization and control theory. V. Yatsenko's research is connected with control of bilinear systems, nonlinear estimation, control of quantum systems, and globabl optimization problems. Both Pardalos and Yatsenko have authored numerous publications including books and well-known scientific journals.

Bibliographic information