Abstract
We present an interior point approach to the zero–one integer programming feasibility problem based on the minimization of a nonconvex potential function. Given a polytope defined by a set of linear inequalities, this procedure generates a sequence of strict interior points of this polytope, such that each consecutive point reduces the value of the potential function. An integer solution (not necessarily feasible) is generated at each iteration by a rounding scheme. The direction used to determine the new iterate is computed by solving a nonconvex quadratic program on an ellipsoid. We illustrate the approach by considering a class of difficult set covering problems that arise from computing the 1-width of the incidence matrix of Steiner triple systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Avis, “A note on some computationally difficult set covering problems,”Mathematical Programming 18 (1980) 138–145.
D.O. Bausch, “Computational advances in the solution of large-scale set covering and set partitioning problems,” Master's thesis, Naval Postgraduate School (Monterey, CA, 1982).
V.J. Bowman and F. Glover, “A note on zero-one integer and concave programming,”Operations Research 20 (1972) 182–183.
B.H. Faaland and F.S. Hillier, “Interior path methods for heuristic integer programming procedures,”Operations Research 27 (1979) 1069–1087.
T.A. Feo and M.G.C. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,”Operations Research Letters 8 (1989) 67–71.
D.R. Fulkerson, G.L. Nemhauser and L.E. Trotter Jr., “Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems,”Mathematical Programming Study 2 (1974) 72–81.
D.M. Gay, “Computing optimal locally constrained steps,”SIAM Journal on Scientific and Statistical Computing 2 (1981) 186–197.
A.M. Geoffrion, “An improved implicit enumeration approach for integer programming,”Operations Research 17 (1969) 437–454.
F. Glover and D. Klingman, “Concave programming applied to a special class of 0–1 integer programs,”Operations Research 21 (1973) 135–140.
M. Hall Jr.,Combinatorial Theory (Blaisdell, Waltham, MA, 1967).
F.S. Hillier, “Efficient heuristic procedures for integer linear programming with an interior,”Operations Research 17 (1969) 600–637.
T. Ibaraki, T. Ohashi and F. Mine, “A heuristic algorithm for mixed-integer programming problems,”Mathematical Programming Study 2 (1974) 115–136.
R.G. Jeroslow and T.H.C. Smith, “Experimental results on Hillier's linear search,”Mathematical Programming 9 (1975) 371–376.
B. Kalantari and J.B. Rosen, “Penalty for zero-one integer equivalent problem,”Mathematical Programming 24 (1982) 229–232.
N. Karmarkar, “An interior-point approach to NP-complete problems,” in:Proceedings of the Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization, University of Waterloo (1990) pp. 351–366.
K. Levenberg, “A method for the solution of certain problems in least squares”Quarterly of Applied Mathematics 2 (1944) 164–168.
D. Marquardt, “An algorithm for least-squares estimation of nonlinear parameters,”SIAM Journal on Applied Mathematics 11 (1963) 431–441.
J.J. Moré, “The Levenberg—Marquandt algorithm: Implementation and theory,” in: G.A. Watson, ed.,Proceedings of the Dundee Conference on Numerical Analysis (Springer, Berlin, 1978).
J.J. Moré and D.C. Sorensen, “Computing a trust region step,”SIAM Journal on Scientific and Statistical Computing 4 (1983) 553–572.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268 (Springer, Berlin, 1987).
P.M. Pardalos and J.B. Rosen, “Methods for global concave minimization: A bibliographic survey,”SIAM Review 28 (1986) 367–379.
M. Raghavachari, “On connections between zero–one integer programming and concave programming under linear constraints,”Operations Research 17 (1969) 680–684.
C.H. Reinsch, “Smoothing by spline functions II,”Numerische Mathematik 16 (1971) 451–454.
S. Sahni, “Computationally related problems,”SIAM Journal of Computing 3 (1974) 262–279.
A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986).
Y. Ye, “On the interior algorithms for nonconvex quadratic programming,” Technical Report, Integrated Systems Inc. (Santa Clara, CA, 1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Karmarkar, N., Resende, M.G.C. & Ramakrishnan, K.G. An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming 52, 597–618 (1991). https://doi.org/10.1007/BF01582907
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582907