Surveys in Combinatorial Optimization - 1st Edition - ISBN: 9780444701367, 9780080872438

Surveys in Combinatorial Optimization, Volume 31

1st Edition

Editors: S. Martello M. Minoux C. Ribeiro Gilbert Laporte
eBook ISBN: 9780080872438
Imprint: North Holland
Published Date: 1st January 1987
Page Count: 383
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

  1. Selected Topics in Scheduling Theory (J. Błażewicz). 2. Quadratic Assignment Problems (G. Finke, R.E. Burkard and F. Rendl). 3. Order Relations of Variables in 0-1 Programming (P.L. Hammer and B. Simeone). 4. Single Facility Location on Networks (P. Hansen, M. Labbé, D. Peeters and J.-F. Thisse). 5. Exact Algorithms for the Vehicle Routing Problem (G. Laporte and Y. Nobert). 6. The Steiner Problem in Graphs (N. Maculan). 7. Algorithms for Knapsack Problems (S. Martello and P. Toth). 8. Linear Assignment Problems (S. Martello and P. Toth). 9. Network Synthesis and Dynamic Network Optimization (M. Minoux). 10. Parallel Computer Models and Combinatorial Algorithms (C.C. Ribeiro). 11. Probabilistic Analysis of Algorithms (A.H.G. Rinnooy Kan).


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).


No. of pages:
© North Holland 1987
North Holland
eBook ISBN:

Ratings and Reviews

About the Editors

S. Martello Editor

M. Minoux Editor

C. Ribeiro Editor

Gilbert Laporte Editor

Affiliations and Expertise

Ecole des Hautes Etudes Commerciales de Montreal, Canada