A cut approach to a class of quadratic integer programming problems

DOI10.1002/NET.3230100407zbMath0452.90051OpenAlexW2091377764MaRDI 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

zbMATH Keywords

algorithmlocation problemlogisticsquadratic integer programmingmaximum flow problemsminimum cut problemscut approachquadratic placement problemsquared Euclidean distance problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Inventory, storage, reservoirs (90B05)

Related Items (1)

Two-stage quadratic integer programs with stochastic right-hand sides

This page was built for publication: A cut approach to a class of quadratic integer programming problems