### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

J BEAZEWKZ Selected topics in scheduling theory | 1 |

G LAPORTE Y NOBERT Exact algorithms for the vehicle routing | 147 |

N MACULAN The Steiner problem in graphs | 185 |

Copyright | |

3 other sections not shown

### Other editions - View all

Surveys in Combinatorial Optimization S. Martello,M. Minoux,C. Ribeiro,Gilbert Laporte Limited preview - 2011 |

### Common terms and phrases

0-1 knapsack problem A.H.G. Rinnooy absolute median analysis applied approach approximation algorithms augmenting path branch and bound capacity Combinatorial complexity considered corresponding current solution deﬁned denote dynamic programming efﬁcient example feasible solution ﬁrst ﬂow formulation given graph G greedy algorithm heuristic Integer Programming Knapsack Problem Lawler Lenstra linear programming Location Problems lower bound machine Martello and Toth Mathematical maximize maximum method minimize Minoux node NP-hard number of processors O(log obtained Operations Research optimization problems optimum partitioning polynomial precedence constraints probabilistic procedure processing proposed QAPs Quadratic Assignment Problem reduced relaxation requirements resource schedule length scheduling problems scheme Science Section set covering problems shortest path solved sorting spanning tree SPDG Steiner Problem Step subproblems subset tasks Theorem tion Travelling Salesman Problem upper bound variables vector Vehicle Routing vertex vertices