Abstract
Five practical problems are each formulated in two different ways as 0–1 integer programming models. All the models have been solved by the Branch and Bound method using a commercial package program. Full details are given of the manner of the different formulations and the computational ease of solving them. The purpose of this paper is to investigate the computational effects of different formulations on such problems. The problems considered are a market allocation problem, a combinatorial problem, two mining problems and a problem of logical design.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Balas, “On the set covering problem”, Paper presented at the Nato Advanced Study Institute, Figueira da Foz, Portugal (May 1972).
E.M.L. Beale and R.E. Small, “Mixed integer programming by a branch and bound technique”, in: W.A. Kalerick, ed., Proceedings of the IFIP congress (Spartan Press, East Lansing, Mi. 1965).
E.M.L. Beale and J.A. Tomlin, “An integer programming approach to a class of combinatorial problems”, Mathematical Programming 1 (1972) 339–344.
M. Benichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribiere and O. Vincent, “Experiments in mixed integer linear programming”, paper presented at the 7th International Symposium on mathematical programming, The Hague, Holland, September 1970.
R.J. Dakin, “A tree search algorithm for mixed integer linear programming problems”, The Computer Journal 8 (1965) 250–255.
P.L. Hammer, “On the use of Boolean functions in 0–1 programming”, Paper presented at the 7th International Symposium on mathematical programming, The Hague, Holland, September 1970.
P.L. Hammer, “Boolean methods for linear 0–1 programming”, Paper presented at the Nato Advanced Study Institute, Figueira da Foz, Portugal (June, 1972).
A.H. Land and A.G. Doig, “An automatic method of solving discrete programming problems”, Econometrica 28 (1960) 497–520.
H. Lerchs and I.F. Grossman, “Optimum design of open pit mines, Transactions of the Canadian Institute of Mining 118 (1965) 17.
Linear Programming Mark 3, Manual for the ICL System XDLA for mathematical programming (International Computers Ltd., Putney, London, England, 1969).
H.H. Meyer, “Applying linear programming to the design of ultimate pit limits”, Management Science 16 (1969) B121–B135.
G. Mitra, “Designing branch and bound algorithms for mathematical programming”, Paper presented at the 7th International Symposium on mathematical programming, The Hague, Holland, September 1970.
S. Muroga, Threshold logic and its applications (Wiley, New York, 1971).
H.P. Williams, “The synthesis of logical nets consisting of NOR units”, The Computer Journal 11 (2) (1968).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 The Mathematical Programming Society
About this chapter
Cite this chapter
Williams, H.P. (1974). Experiments in the formulation of integer programming problems. In: Balinski, M.L. (eds) Approaches to Integer Programming. Mathematical Programming Studies, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120693
Download citation
DOI: https://doi.org/10.1007/BFb0120693
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00739-2
Online ISBN: 978-3-642-00740-8
eBook Packages: Springer Book Archive