Handbook of Combinatorial Optimization

Overview

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-volumework 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, ...

See more details below
Hardcover (2nd ed. 2013)
$3,002.54
BN.com price
(Save 11%)$3,400.00 List Price
Other sellers (Hardcover)
  • All (1) from $1,764.79   
  • New (1) from $1,764.79   
Sending request ...

Overview

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-volumework 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. Aninternational 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.

Read More Show Less

Product Details

  • ISBN-13: 9781441979964
  • Publisher: Springer New York
  • Publication date: 4/1/2014
  • Edition description: 2nd ed. 2013
  • Edition number: 2
  • Pages: 4930

Meet the Author

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.
Read More Show Less

Table of Contents

A Unified Approach for Domination Problems on Different Network Topologies

Advanced Techniques for Dynamic Programming

Advances in Group Testing

Advances in Scheduling Problems

Algebrization and Randomization Methods

Algorithmic Aspects of Domination in Graphs

Algorithms and Metaheuristics for Combinatorial Matrices

Algorithms for the Satisfiability Problem

Bin Packing Approximation Algorithms: Survey and Classification

Binary Unconstrained Quadratic Optimization Problem

Combinatorial Optimization Algorithms for Probe Design and Selection Problems

Combinatorial Optimization in Data Mining

Combinatorial Optimization Techniques for Network-based Data Mining

Combinatorial Optimization Techniques in Transportation and Logistic Networks

Complexity Issues on PTAS

Computing Distances between Evolutionary Trees

Connected Dominating Set in Wireless Networks

Connections between Continuous and Discrete Extremum Problems, Generalized Systems and Variational Inequalities

Coverage Problems in Sensor Networks

Data Correcting Approach for Routing and Location in Networks

Dual Integrality in Combinatorial Optimization

Dynamical System Approaches to Combinatorial Optimization

Efficient Algorithms for Geometric Shortest Path Query Problems

Energy Efficiency in Wireless Networks

Equitable Coloring of Graphs

Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches

Fault-Tolerant Facility Allocation

Fractional Combinatorial Optimization

Fuzzy Combinatorial Optimization Problems

Geometric Optimization in Wireless Networks

Gradient-Constrained Minimum Interconnection Networks

Graph Searching and Related Problems

Graph Theoretic Clique Relaxations and Applications

Greedy Approximation Algorithms

Hardness and Approximation of Network Vulnerability

Job Shop Scheduling with Petri Nets

Key Tree Optimization

Linear Programming Analysis of Switching Networks

Map of Geometric Minimal Cuts with Applications

Max-Coloring

Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs

Modern Network Interdiction Problems and Algorithms

Network Optimization

Neural Network Models in Combinatorial Optimization

On Coloring Problems

Online and Semi-online Scheduling

Online Frequency Allocation and Mechanism Design for Cognitive Radio Wireless Networks

Optimal Partitions

Optimization in Multi-Channel Wireless Networks

Optimization Problems in Data Broadcasting

Optimization Problems in Online Social Networks

Optimizing Data Collection Capacity in Wireless Networks

Packing Circles in Circles and Applications

Partition in High Dimensional Spaces

Probabilistic Verification and Non-approximability

Protein Docking Problem as Combinatorial Optimization Using Beta-complex

Quadratic Assignment Problems

Reactive Business Intelligence: Combining the Power of Optimization with Machine Learning

Reformulation-Linearization Techniques for Discrete Optimization Problems

Resource Allocation Problems

Rollout Algorithms for Discrete Optimization: A Survey

Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations

Small World Networks in Computational Neuroscience

Social Structure Detection

Steiner Minimal Trees: An Introduction, Parallel Computation and Future Work

Steiner Minimum Trees in E^3

Tabu Search

Variations of Dominating Set Problem

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)