A cut approach to a class of quadratic integer programming problems

DOI10.1002/NET.3230100407MaRDI QIDQ3899822zbMATH OpenOpenAlexFDO

Authors 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

algorithmcut approachlocation problemlogisticsmaximum flow problemsminimum cut problemsquadratic integer programmingquadratic placement problemsquared Euclidean distance problem

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3899822)