{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:46Z","timestamp":1761620746300},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00252-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"3-11","source":"Crossref","is-referenced-by-count":17,"title":["On some difficult linear programs coming from set partitioning"],"prefix":"10.1016","volume":"118","author":[{"given":"Francisco","family":"Barahona","sequence":"first","affiliation":[]},{"given":"Ranga","family":"Anbil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00252-9_BIB1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","article-title":"A generalization of Polyak's convergence result for subgradient optimization","volume":"37","author":"Allen","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1147\/sj.311.0071","article-title":"A Global approach to crew-pairing optimization","volume":"31","author":"Anbil","year":"1992","journal-title":"IBM Syst. J."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB3","unstructured":"L. Bahiense, N. Maculan, C. Sagastiz\u00e1bal, On the convergence of the volume algorithm, Technical Report, 2000."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB4","unstructured":"B.M. Baker, J. Sheasby, Accelerating the convergence of subgradient optimization, Technical Report, Coventry University, UK, 1996."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization","volume":"12","author":"Balas","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","article-title":"The volume algorithm: producing primal solutions with a subgradient method","volume":"87","author":"Barahona","year":"2000","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB7","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","article-title":"On the choice of step size in subgradient optimization","volume":"7","author":"Bazaraa","year":"1981","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB8","unstructured":"D. Bienstock, Experiments with a network design algorithm using \u03b5-approximate linear programs, Technical Report, Columbia University, 1996."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB10","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","article-title":"A heuristic method for the set covering problem","volume":"47","author":"Caprara","year":"1999","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01581106","article-title":"A lagrangian based heuristic for large scale set covering problems","volume":"81","author":"Ceria","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB12","unstructured":"IBM Corporation, Optimization Subroutine Library: Guide and reference (1995)."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB13","unstructured":"H. Crowder, Computational improvements for subgradient optimization, in: Symposia Mathematica, Vol. XIX, Academic Press, London, 1976, pp. 357\u2013372."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB14","first-page":"1","article-title":"Methods of solution of nonlinear extremal problems","volume":"4","author":"Ermoliev","year":"1966","journal-title":"Kibernetika"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB15","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.25.5.760","article-title":"The set-covering problem: a new implicit enumeration algorithm","volume":"25","author":"Etcheberry","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On convergence rates of subgradient optimization methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB17","series-title":"Nonlinear Programming, 4","first-page":"283","article-title":"Convergence Results in a class of variable metric subgradient methods","author":"Goffin","year":"1981"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB18","doi-asserted-by":"crossref","unstructured":"A. Goldberg, J.D. Oldham, S. Plotkin, C. Stein, An implementation of a combinatorial approximation algorithm for minimum cost multicommodity flows, Technical Report STAN-CS-TR-97-1600, Stanford University, 1997.","DOI":"10.1007\/3-540-69346-7_26"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB19","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB20","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling salesman problem and minimum spanning trees: part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01588797","article-title":"Variable target value subgradient method","volume":"49","author":"Kim","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB23","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1137\/S0363012994261483","article-title":"The efficiency of subgradient projection methods for convex optimization, part I: General level methods","volume":"34","author":"Kiwiel","year":"1996","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/moor.24.1.237","article-title":"The efficiency of ballstep subgradient level methods for convex optimization","volume":"24","author":"Kiwiel","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB25","first-page":"663","article-title":"Convex Optimization with prescribed accuracy","volume":"30","author":"Kulikov","year":"1990","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB26","series-title":"Optimization, Handbooks in Operations Research","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/S0927-0507(89)01008-X","article-title":"Nondifferentiable optimization","author":"Lemar\u00e9chal","year":"1989"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB27","first-page":"519","article-title":"Minimization methods for nonsmooth convex and quasiconvex functions","volume":"29","author":"Nesterov","year":"1984","journal-title":"Matekon"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB28","first-page":"593","article-title":"A general method for solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Soviet. Math. Dokl."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB29","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of unsmooth functionals","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. and Math. Phys."},{"key":"10.1016\/S0166-218X(01)00252-9_BIB30","series-title":"Minimization Methods for Nondifferentiable Functions","author":"Shor","year":"1985"},{"key":"10.1016\/S0166-218X(01)00252-9_BIB31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","article-title":"A method of conjugate subgradients for minimizing nondifferentiable functions","volume":"3","author":"Wolfe","year":"1975","journal-title":"Math. Programming Study"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T23:35:02Z","timestamp":1680824102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002529"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00252-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}