A cut approach to a class of quadratic integer programming problems
From MaRDI portal
Publication:3899822
DOI10.1002/net.3230100407zbMath0452.90051MaRDI QIDQ3899822
Jean-Claude Picard, H. Donald Ratliff
Publication date: 1981
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230100407
algorithm; location problem; logistics; quadratic integer programming; maximum flow problems; minimum cut problems; cut approach; quadratic placement problem; squared Euclidean distance problem
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C20: Quadratic programming
90B05: Inventory, storage, reservoirs
Related Items