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

Finite Dominating Sets for Network Location Problems

โœ Scribed by J. N. Hooker, R. S. Garfinkel and C. K. Chen

Book ID
123687535
Publisher
INFORMS
Year
1991
Tongue
English
Weight
650 KB
Volume
39
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Dominating sets for rectilinear center l
Dominating sets for rectilinear center location problems with polyhedral barriers
โœ P.M. Dearing; H.W. Hamacher; K. Klamroth ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 199 KB

## Abstract In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective functi

Upwind basis finite elements for convect
Upwind basis finite elements for convection-dominated problems
โœ P. M. Steffler ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 836 KB

Finite elements using higher-order basis functions in the spirit of the QUICK method for cpnvectiondominated fluid flow and transport problems are introduced and demonstrated. Instead of introducing new internal degrees of freedom, completeness is achieved by including functions based on nodal value