2013

Handbook of Combinatorial Optimization

Editors:

ISBN: 978-1-4419-7996-4 (Print) 978-1-4419-7997-1 (Online)

Table of contents (68 entries)

previous Page of 4
  1. Front Matter

    Pages 1-21

  2. No Access

    Reference Work Entry

    Pages 1-40

    A Unified Approach for Domination Problems on Different Network Topologies

  3. No Access

    Reference Work Entry

    Pages 41-92

    Advanced Techniques for Dynamic Programming

  4. No Access

    Reference Work Entry

    Pages 93-144

    Advances in Group Testing

  5. No Access

    Reference Work Entry

    Pages 145-169

    Advances in Scheduling Problems

  6. No Access

    Reference Work Entry

    Pages 171-220

    Algebrization and Randomization Methods

  7. No Access

    Reference Work Entry

    Pages 221-282

    Algorithmic Aspects of Domination in Graphs

  8. No Access

    Reference Work Entry

    Pages 283-309

    Algorithms and Metaheuristics for Combinatorial Matrices

  9. No Access

    Reference Work Entry

    Pages 311-454

    Algorithms for the Satisfiability Problem

  10. No Access

    Reference Work Entry

    Pages 455-531

    Bin Packing Approximation Algorithms: Survey and Classification

  11. No Access

    Reference Work Entry

    Pages 533-557

    Binary Unconstrained Quadratic Optimization Problem

  12. No Access

    Reference Work Entry

    Pages 559-593

    Combinatorial Optimization Algorithms

  13. No Access

    Reference Work Entry

    Pages 595-630

    Combinatorial Optimization in Data Mining

  14. No Access

    Reference Work Entry

    Pages 631-672

    Combinatorial Optimization Techniques for Network-Based Data Mining

  15. No Access

    Reference Work Entry

    Pages 673-722

    Combinatorial Optimization in Transportation and Logistics Networks

  16. No Access

    Reference Work Entry

    Pages 723-746

    Complexity Issues on PTAS

  17. No Access

    Reference Work Entry

    Pages 747-781

    Computing Distances Between Evolutionary Trees

  18. No Access

    Reference Work Entry

    Pages 783-833

    Connected Dominating Set in Wireless Networks

  19. No Access

    Reference Work Entry

    Pages 835-898

    Connections Between Continuous and Discrete Extremum Problems, Generalized Systems, andVariational Inequalities

  20. No Access

    Reference Work Entry

    Pages 899-927

    Coverage Problems in Sensor Networks

  21. No Access

    Reference Work Entry

    Pages 929-993

    Data Correcting Approach for Routing and Location in Networks

previous Page of 4