{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T17:28:09Z","timestamp":1769189289927,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1007\/bf01582907","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"597-618","source":"Crossref","is-referenced-by-count":50,"title":["An interior point algorithm to solve computationally difficult set covering problems"],"prefix":"10.1007","volume":"52","author":[{"given":"Narendra","family":"Karmarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"18","author":"D. Avis","year":"1980","unstructured":"D. Avis, \u201cA note on some computationally difficult set covering problems,\u201dMathematical Programming 18 (1980) 138\u2013145.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"Computational advances in the solution of large-scale set covering and set partitioning problems","author":"D.O. Bausch","year":"1982","unstructured":"D.O. Bausch, \u201cComputational advances in the solution of large-scale set covering and set partitioning problems,\u201d Master's thesis, Naval Postgraduate School (Monterey, CA, 1982)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/opre.20.1.182","volume":"20","author":"V.J. Bowman","year":"1972","unstructured":"V.J. Bowman and F. Glover, \u201cA note on zero-one integer and concave programming,\u201dOperations Research 20 (1972) 182\u2013183.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1287\/opre.27.6.1069","volume":"27","author":"B.H. Faaland","year":"1979","unstructured":"B.H. Faaland and F.S. Hillier, \u201cInterior path methods for heuristic integer programming procedures,\u201dOperations Research 27 (1979) 1069\u20131087.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and M.G.C. Resende, \u201cA probabilistic heuristic for a computationally difficult set covering problem,\u201dOperations Research Letters 8 (1989) 67\u201371.","journal-title":"Operations Research Letters"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, G.L. Nemhauser and L.E. Trotter Jr., \u201cTwo computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems,\u201dMathematical Programming Study 2 (1974) 72\u201381.","journal-title":"Mathematical Programming Study"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"D.M. Gay, \u201cComputing optimal locally constrained steps,\u201dSIAM Journal on Scientific and Statistical Computing 2 (1981) 186\u2013197.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A.M. Geoffrion","year":"1969","unstructured":"A.M. Geoffrion, \u201cAn improved implicit enumeration approach for integer programming,\u201dOperations Research 17 (1969) 437\u2013454.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/opre.21.1.135","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover and D. Klingman, \u201cConcave programming applied to a special class of 0\u20131 integer programs,\u201dOperations Research 21 (1973) 135\u2013140.","journal-title":"Operations Research"},{"key":"CR10","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1967","unstructured":"M. Hall Jr.,Combinatorial Theory (Blaisdell, Waltham, MA, 1967)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.17.4.600","volume":"17","author":"F.S. Hillier","year":"1969","unstructured":"F.S. Hillier, \u201cEfficient heuristic procedures for integer linear programming with an interior,\u201dOperations Research 17 (1969) 600\u2013637.","journal-title":"Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0120691","volume":"2","author":"T. Ibaraki","year":"1974","unstructured":"T. Ibaraki, T. Ohashi and F. Mine, \u201cA heuristic algorithm for mixed-integer programming problems,\u201dMathematical Programming Study 2 (1974) 115\u2013136.","journal-title":"Mathematical Programming Study"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF01681357","volume":"9","author":"R.G. Jeroslow","year":"1975","unstructured":"R.G. Jeroslow and T.H.C. Smith, \u201cExperimental results on Hillier's linear search,\u201dMathematical Programming 9 (1975) 371\u2013376.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01585106","volume":"24","author":"B. Kalantari","year":"1982","unstructured":"B. Kalantari and J.B. Rosen, \u201cPenalty for zero-one integer equivalent problem,\u201dMathematical Programming 24 (1982) 229\u2013232.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, \u201cAn interior-point approach to NP-complete problems,\u201d in:Proceedings of the Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization, University of Waterloo (1990) pp. 351\u2013366.","DOI":"10.1090\/conm\/114\/1097880"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K. Levenberg","year":"1944","unstructured":"K. Levenberg, \u201cA method for the solution of certain problems in least squares\u201dQuarterly of Applied Mathematics 2 (1944) 164\u2013168.","journal-title":"Quarterly of Applied Mathematics"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"D. Marquardt","year":"1963","unstructured":"D. Marquardt, \u201cAn algorithm for least-squares estimation of nonlinear parameters,\u201dSIAM Journal on Applied Mathematics 11 (1963) 431\u2013441.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR18","volume-title":"Proceedings of the Dundee Conference on Numerical Analysis","author":"J.J. Mor\u00e9","year":"1978","unstructured":"J.J. Mor\u00e9, \u201cThe Levenberg\u2014Marquandt algorithm: Implementation and theory,\u201d in: G.A. Watson, ed.,Proceedings of the Dundee Conference on Numerical Analysis (Springer, Berlin, 1978)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"J.J. Mor\u00e9 and D.C. Sorensen, \u201cComputing a trust region step,\u201dSIAM Journal on Scientific and Statistical Computing 4 (1983) 553\u2013572.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268","author":"P.M. Pardalos","year":"1987","unstructured":"P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268 (Springer, Berlin, 1987)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"P.M. Pardalos","year":"1986","unstructured":"P.M. Pardalos and J.B. Rosen, \u201cMethods for global concave minimization: A bibliographic survey,\u201dSIAM Review 28 (1986) 367\u2013379.","journal-title":"SIAM Review"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari, \u201cOn connections between zero\u2013one integer programming and concave programming under linear constraints,\u201dOperations Research 17 (1969) 680\u2013684.","journal-title":"Operations Research"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02169154","volume":"16","author":"C.H. Reinsch","year":"1971","unstructured":"C.H. Reinsch, \u201cSmoothing by spline functions II,\u201dNumerische Mathematik 16 (1971) 451\u2013454.","journal-title":"Numerische Mathematik"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"S. Sahni, \u201cComputationally related problems,\u201dSIAM Journal of Computing 3 (1974) 262\u2013279.","journal-title":"SIAM Journal of Computing"},{"key":"CR26","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."},{"key":"CR27","volume-title":"\u201cOn the interior algorithms for nonconvex quadratic programming,\u201d Technical Report","author":"Y. Ye","year":"1988","unstructured":"Y. Ye, \u201cOn the interior algorithms for nonconvex quadratic programming,\u201d Technical Report, Integrated Systems Inc. (Santa Clara, CA, 1988)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582907.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582907\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T08:16:40Z","timestamp":1706170600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582907"],"URL":"https:\/\/doi.org\/10.1007\/bf01582907","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}