## Handbook of combinatorial optimization, Volume 2This 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 |

749 | |

### Other editions - View all

Handbook of Combinatorial Optimization: Supplement, Volume 1 Ding-Zhu Du,Panos M. Pardalos Limited preview - 2013 |

### Common terms and phrases

aircraft airline applications approximation assignment problem binary Chromatic Number cluster coloring problem combinatorial optimization complexity Computational Geometry consider constraints construction convex function cooperative game core corresponding cost data set data structure decomposition defined denote Discrete Discrete Mathematics edge Figure fj(xj flight given Graph Coloring heuristic integer Journal Lemma length lower bound Math Mathematics matrix maximizing method minimum weight triangulation nni distance nodes NP-hard O(nlogn Operations Research optimal solution optimization problems pair partition planar graphs plane polygonal obstacles polynomial Proc proof ratio rectilinear resource allocation problem SC/Simple/D SC/SM/D scheduling Section sequence short path shortest path queries Simulated Annealing solution concepts solved spanning tree Steiner Hull Steiner Minimal Tree Steiner points Steiner ratio Steiner tree submodular system subset subtree subtree-transfer Theorem Theory TJist topology transform variables vector vertex set vertices visibility graph von Neumann-Morgenstern solution x m grids x m Pattern

### Popular passages

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