Skip to main content
  • Reference work
  • © 2013

Handbook of Combinatorial Optimization

  • This second edition features 30% new additional content, additional chapters as well as updated content
  • Editors-in-chief are renowned members of the operations research and mathematics communities
  • Subject spans much of applied mathematics, computer science and operations research as well as overlaps with many other fields such as computation complexity, computational biology, VLSI design, communications networks, and management science

Buy it now

Buying options

eBook USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (68 entries)

  1. Front Matter

    Pages 1-21
  2. A Unified Approach for Domination Problems on Different Network Topologies

    • Thang N. Dinh, D. T. Nguyen, My T. Thai
    Pages 1-40
  3. Advances in Group Testing

    • Yongxi Cheng
    Pages 93-144
  4. Advances in Scheduling Problems

    • Ming Liu, Feifeng Zheng
    Pages 145-169
  5. Algebrization and Randomization Methods

    • Liang Ding, Bin Fu
    Pages 171-220
  6. Algorithmic Aspects of Domination in Graphs

    • Gerard Jennhwa Chang
    Pages 221-282
  7. Algorithms for the Satisfiability Problem

    • John Franco, Sean Weaver
    Pages 311-454
  8. Bin Packing Approximation Algorithms: Survey and Classification

    • Edward G. Coffman Jr., János Csirik, Gábor Galambos, Silvano Martello, Daniele Vigo
    Pages 455-531
  9. Binary Unconstrained Quadratic Optimization Problem

    • Gary A. Kochenberger, Fred Glover, Haibo Wang
    Pages 533-557
  10. Combinatorial Optimization Algorithms

    • Elisa Pappalardo, Beyza Ahlatcioglu Ozkok, Panos M. Pardalos
    Pages 559-593
  11. Combinatorial Optimization in Data Mining

    • Samira Saedi, O. Erhun Kundakcioglu
    Pages 595-630
  12. Combinatorial Optimization Techniques for Network-Based Data Mining

    • Oleg Shirokikh, Vladimir Stozhkov, Vladimir Boginski
    Pages 631-672
  13. Combinatorial Optimization in Transportation and Logistics Networks

    • Chrysafis Vogiatzis, Panos M Pardalos
    Pages 673-722
  14. Complexity Issues on PTAS

    • Jianer Chen, Ge Xia
    Pages 723-746
  15. Computing Distances Between Evolutionary Trees

    • Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Lusheng Wang et al.
    Pages 747-781
  16. Connected Dominating Set in Wireless Networks

    • Hongjie Du, Ling Ding, Weili Wu, Donghyun Kim, Panos M. Pardalos, James Willson
    Pages 783-833
  17. Coverage Problems in Sensor Networks

    • Mihaela Cardei
    Pages 899-927

About this book

The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board.

The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as non-specialists will find the material stimulating and useful.

Editors and Affiliations

  • Department of Industrial and Systems Eng, University of Florida, Gainesville, USA

    Panos M. Pardalos

  • Department of Computer Science, University of Texas, Dallas, Richardson, USA

    Ding-Zhu Du

  • Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, USA

    Ronald L. Graham

About the editors

Panos M. Pardalos, Ding-Zhu Du, and Ronald Graham are prominent members of the operations research and mathematics communities. See supplementary PDF for additional biography material.

Bibliographic Information

  • Book Title: Handbook of Combinatorial Optimization

  • Editors: Panos M. Pardalos, Ding-Zhu Du, Ronald L. Graham

  • DOI: https://doi.org/10.1007/978-1-4419-7997-1

  • Publisher: Springer New York, NY

  • eBook Packages: Mathematics and Statistics, Reference Module Computer Science and Engineering

  • Copyright Information: Springer Science+Business Media New York 2013

  • Hardcover ISBN: 978-1-4419-7996-4Published: 07 September 2013

  • eBook ISBN: 978-1-4419-7997-1Published: 06 September 2013

  • Edition Number: 2

  • Number of Pages: XXI, 3409

  • Number of Illustrations: 516 b/w illustrations, 169 illustrations in colour

  • Topics: Optimization, Combinatorics

Buy it now

Buying options

eBook USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access