The problem of partitioning a sequence of \(n\) real numbers into \(p\) intervals is considered. The goal is to find a partition such that the cost of the most expensive interval measured with a cost function \(f\) is minimized. An efficient algorithm which solves the problem in time \(O((n-p) p \lo
The optimal partitioning of networks
β Scribed by Chung-Kuan Cheng
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Volume
- 22
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The problem of selecting the best pattern of pipe diameters of an irrigation network has long been given considerable attention by engineers when designing hydraulic works. The classical optimization techniques, which have been proposed until now, are the following: (1) the linear programming method
## Abstract OPEP is a suite of FORTRAN programs targeted at the optimal partitioning of molecular electric properties. It includes an interactive module for the construction of Cartesian grids of points, on which either the molecular electrostatic potential or the induction energy is mapped. The ge