๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An exact algorithm for team orienteering problems

โœ Scribed by Sylvain Boussier; Dominique Feillet; Michel Gendreau

Publisher
Springer
Year
2006
Tongue
English
Weight
227 KB
Volume
5
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An exact algorithm for large multiple kn
An exact algorithm for large multiple knapsack problems
โœ David Pisinger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total proยฎt sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ยฎnancial ma

An exact algorithm for the concave trans
An exact algorithm for the concave transportation problem
โœ Leon Cooper; Mary W. Cooper ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 810 KB

## AbstractAn exact method for solving a class of concave transportation problems which reflect economies of scale is presented. By exploiting concepts of dynamic programming and an analysis of the nature of the recursion, an analytic representation of the optimal allocation at each stage has been