1. The Linear Sum Assignment Problem -- 2. The Linear Bottleneck Assignment Problem -- 3. The Cardinality Matching Problem -- 4. The Sum Matching Problem -- 5. The Bottleneck Matching Problem -- 6. The Chinese Postman Problem -- 7. Quadratic Assignment Problems -- 8. QAP Heuristic 1: The method...

This paper deals with transportation problems whose demand vectors can be permuted. This additional freedom makes these problems ??-hard, even in the case that the cost matrix fulfills a Monge property. We outline some solution procedures based on good lower and upper bounds. Copyright...

Given n points in the plane with nonnegative weights, the inverse Fermat-Weber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1-median. The cost is proportional to the increase or decrease of the corresponding weight. In...