Picard, Jean-Claude; Ratliff, H. Donald A cut approach to a class of quadratic integer programming problems. (English) Zbl 0452.90051 Networks 10, 363-370 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 90C10 Integer programming 90C20 Quadratic programming 90B05 Inventory, storage, reservoirs 65K05 Numerical mathematical programming methods Keywords:cut approach; quadratic integer programming; quadratic placement problem; squared Euclidean distance problem; minimum cut problems; maximum flow problems; location problem; algorithm; logistics PDF BibTeX XML Cite \textit{J.-C. Picard} and \textit{H. D. Ratliff}, Networks 10, 363--370 (1981; Zbl 0452.90051) Full Text: DOI References: [1] Hall, Manage. Sci. 17 pp 219– (1970) [2] Hammer, Rev. Math. Pures Appl. 8 pp 459– (1963) [3] and , Boolean Methods in Operations Research, Springer-Verlag, New York, 1965. [4] Picard, Networks 5 pp 357– (1975) [5] Picard, Oper. Res. [6] White, AIIE Trans. 3 pp 156– (1971) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.