Surveys in Combinatorial Optimization ( Volume 31 )

Publication series :Volume 31

Author: Martello   S.;Minoux   M.;Ribeiro   C.  

Publisher: Elsevier Science‎

Publication year: 2011

E-ISBN: 9780080872438

P-ISBN(Paperback): 9780444701367

P-ISBN(Hardback):  9780444701367

Subject: O211 probability (probability theory, probability theory)

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

A collection of papers surveying recent progress in the field of Combinatorial Optimization.

Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem and Scheduling Problems).

Chapter

Front Cover

pp.:  1 – 4

Copyright Page

pp.:  5 – 10

Preface

pp.:  8 – 12

Contents

pp.:  10 – 8

Chapter 2. Quadratic assignment problems

pp.:  72 – 94

Chapter 3. Order relations of variables in 0-1 programming

pp.:  94 – 124

Chapter 4. Single facility location on networks

pp.:  124 – 158

Chapter 5. Exact algorithms for the vehicle routing problem

pp.:  158 – 196

Chapter 6. The Steiner problem in graphs

pp.:  196 – 224

Chapter 7. Algorithms for knapsack problems

pp.:  224 – 270

Chapter 8. Linear assignment problems

pp.:  270 – 294

Chapter 9. Network synthesis and dynamic network optimization

pp.:  294 – 336

Chapter 10. Parallel computer models and combinatorial algorithms

pp.:  336 – 376

Chapter 11. Probabilistic analysis of algorithms

pp.:  376 – 396

The users who browse this book also browse


No browse record.