𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A unified approach to network location p
✍ Nickel, Stefan; Puerto, Justo πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 124 KB πŸ‘ 2 views

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

A neural network approach to tiling prob
✍ T. Tambouratzis πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

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

Neural network approach to the ECM probl
✍ Keniti Gonoi; Takakazu Kurokawa πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views
Exact approaches to the single-source ne
✍ Ivana LjubiΔ‡; Peter Putz; Juan-JosΓ© Salazar-GonzΓ‘lez πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 329 KB

## 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

IDEAS approach to process network synthe
✍ Stevan Wilson; Vasilios Manousiouthakis πŸ“‚ Article πŸ“… 2000 πŸ› American Institute of Chemical Engineers 🌐 English βš– 924 KB

## 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