In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci
Vector processing approach to constrained network problems
β Scribed by M. A. Venkataramana; John J. Dinkel; John Mote
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 834 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has
## Abstract This article considers the network design problem that searches for a minimumβcost way of installing capacities on the edges of a network to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact
## Abstract A novel method for the globally optimal solution of the general process network synthesis problem is first presented and then applied to the solution of the minimum utility cost (MUC) problem for mass exchange networks (MEN) with multicomponent targets (MT). Previous approaches that add