Surveys in Combinatorial Optimization
- 1st Edition, Volume 31 - January 1, 1987
- Latest edition
- Editors: S. Martello, M. Minoux, C. Ribeiro, Gilbert Laporte
- Language: English
A collection of papers surveying recent progress in the field of Combinatorial Optimization.Topics examined include theoretical and computational aspects (Boolean Programming, P… Read more
Data Mining & ML
Unlock the cutting edge
Up to 20% on trusted resources. Build expertise with data mining, ML methods.
Description
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).
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).
Table of contents
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).
Product details
Product details
- Edition: 1
- Latest edition
- Volume: 31
- Published: September 22, 2011
- Language: English
About the editor
About the editor
GL
Gilbert Laporte
Affiliations and expertise
Ecole des Hautes Etudes Commerciales de Montreal, CanadaView book on ScienceDirect
View book on ScienceDirect
Read Surveys in Combinatorial Optimization on ScienceDirect