The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
β Scribed by Warwick J Comley
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 489 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper reports a new formulation of a general hub location model as a quadratic integer program. Non-convexity of the objective function makes the problem difficult. A variety of alternative solution strategies are discussed. Computational results from two simple heuristics are presented for the
The classical EnestΓΆm-Kekeya Theorem states that a polynomial \(p(z)=\) \(\sum_{i=0}^{n} a_{i} z^{\prime}\) satisfying \(0<a_{0} \leq a_{1} \leq \cdots \leq a_{n}\) has all its zeros in \(|z| \leq 1\). We extend this result to a larger class of polynomials by dropping the conditions that the coeffic