Abstract
In this paper, we discuss the solution of a class of modified quadratic assignment problems, with particular reference to an application involving decentralization of a large organization. The main emphasis is on the use of a standard branch and bound mathematical programming system (UMPIRE) and the problem manipulations required to carry this out efficiently.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
E.M.L. Beale and J.A. Tomlin, “Special facilities in a general mathematical programming system for non-convex problems using special ordered sets of variables”, in:Proceedings of the 5th IFORS Conference, Ed. J. Lawrence (Tavistock, London, 1970) pp. 447–454.
M.C.J. Elton, P.M. Hollis, J.M.H. Hunter, D.W. Millon and J.P. Turner, “An approach to the location of government”, presented at theTIMS International Conference, London, 1970.
J.J.H. Forrest, J.P.H. Hirst and J.A. Tomlin, “Practical solution of large and complex integer programming problems with UMPIRE”,Management Science (1972), to appear.
T.C. Koopmans and M.J. Beckmann, “Assignment problems and the location of economic activities”,Econometrica 25 (1957) 57–76.
J.A. Tomlin, “Branch and bound methods for integer and non-convex programming”, in:Integer and non-linear programming, Ed. J.Abadie (North-Holland, Amsterdam, 1970) pp. 437–450.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beale, E.M.L., Tomlin, J.A. An integer programming approach to a class of combinatorial problems. Mathematical Programming 3, 339–344 (1972). https://doi.org/10.1007/BF01585006
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585006