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

An asymptotically exact polynomial algorithm for equipartition problems

โœ Scribed by Bruno Simeone

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
397 KB
Volume
14
Category
Article
ISSN
0166-218X

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

An exact algorithm for a core/periphery
An exact algorithm for a core/periphery bipartitioning problem
โœ Michael Brusco ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 427 KB

The discrete optimization problem associated with partitioning a set of actors into core and periphery subsets has typically been approached using approximate procedures such as exchange heuristics, genetic algorithms, and simulated annealing. Although these procedures are effective and scalable for