The complexity of minimum cut and maximum flow problems in an acyclic network
โ Scribed by Vijaya Ramachandran
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 314 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order ฯ and index ฮป having minimum block size $k \ge t+1$, then, They showed that when __t__โ=โ2 or 3, this bound is sharp infinitely often in that for each __h__โโฅโ__t__ and each __k__โโฅโ_
The solution of the equation system of the ยฎnite element method for diusion problems is presented in the format of a sequence. The characteristics of the numerical results can thus be known through an analysis of this `theoretical expression' of the solution. The characteristics of the sequence are
## Abstract Starting from the topicality of the issues related to the location of undesirable facilities and on the basis of a brief review of the types of models that are currently being used in the Municipal Solid Waste Management context, the present paper proposes a multicriteria approach that