Start Reading

Surveys in Combinatorial Optimization

Length: 380 pages9 hours


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

Read on the Scribd mobile app

Download the free Scribd mobile app to read anytime, anywhere.