{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T20:05:50Z","timestamp":1768075550257,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11590-010-0255-1","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T11:00:55Z","timestamp":1288695655000},"page":"127-139","source":"Crossref","is-referenced-by-count":5,"title":["Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs"],"prefix":"10.1007","volume":"6","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Cole","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"key":"255_CR1","unstructured":"Applegate, D., Bixby, R.E., Chv\u00e1tal, V., Cook, W.: Finding cuts in the TSP. Technical Report 09-05, DIMACS (1995)"},{"key":"255_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201331 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"1\u20133","key":"255_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"255_CR4","first-page":"169","volume":"1","author":"E. Balas","year":"2009","unstructured":"Balas E., Bonami P.: Generating lift-and-project cuts from the LP simplex tableau: Open source implementation and testing of new variants. Math. Program. Comput. 1(2\u20133), 169\u2013199 (2009)","journal-title":"Math. Program. Comput."},{"key":"255_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona F., Anbil R.: The volume algorithm: Producing primal solutions with a subgradient method. Math. Program. 87, 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"255_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"Camerini P.M., Fratta L., Maffioli F.: On improving relaxation methods by modified gradient techniques. Math. Program. Study 3, 26\u201334 (1975)","journal-title":"Math. Program. Study"},{"issue":"1","key":"255_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M. Fisher","year":"1981","unstructured":"Fisher M.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27(1), 1\u201318 (1981)","journal-title":"Manage. Sci."},{"key":"255_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"Held M., Wolfe P., Crowder H.: Validation of subgradient optimization. Math. Program. 6, 62\u201388 (1974)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"255_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K.C. Kiwiel","year":"1990","unstructured":"Kiwiel K.C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1\u20133), 105\u2013122 (1990)","journal-title":"Math. Program."},{"key":"255_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"T. Larsson","year":"1999","unstructured":"Larsson T., Patriksson M., Str\u00f6mberg A.-B.: Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86, 283\u2013312 (1999)","journal-title":"Math. Program."},{"key":"255_CR11","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization, second edition. Wiley, New York (1999)","edition":"2"},{"key":"255_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y. Nesterov","year":"2005","unstructured":"Nesterov Y.: Smooth minimization of non-smooth functions. Mathematical Programming 103, 127\u2013152 (2005)","journal-title":"Mathematical Programming"},{"key":"255_CR13","first-page":"593","volume":"8","author":"B.T. Polyak","year":"1967","unstructured":"Polyak B.T.: A general method of solving extremum problems. Sov. Math. Doklady 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Doklady"},{"key":"255_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak B.T.: Minimization of unsmooth functionals. USSR Comput. Mathematics and Mathematical Physics 9, 14\u201329 (1969)","journal-title":"USSR Comput. Mathematics and Mathematical Physics"},{"key":"255_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"J.F. Shapiro","year":"1979","unstructured":"Shapiro J.F.: A survey of Lagrangean techniques for discrete optimization. Ann. Discrete Math. 5, 113\u2013138 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"255_CR16","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali H.D., Adams W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"255_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H.D. Sherali","year":"1994","unstructured":"Sherali H.D., Adams W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52(1), 83\u2013106 (1994)","journal-title":"Discrete Appl. Math."},{"key":"255_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1999","unstructured":"Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"3","key":"255_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","volume":"19","author":"H.D. Sherali","year":"1996","unstructured":"Sherali H.D., Choi G.: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19(3), 105\u2013113 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"255_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00063-2","volume":"26","author":"H.D. Sherali","year":"2000","unstructured":"Sherali H.D., Choi G., Tuncbilek C.H.: A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26(1), 1\u20138 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"255_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.orl.2003.12.006","volume":"32","author":"H.D. Sherali","year":"2004","unstructured":"Sherali H.D., Lim C.: On embedding the Volume Algorithm in a variable target value method for solving Lagrangian relaxations of linear programs. Oper. Res. Lett. 32(5), 455\u2013462 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"255_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/ijoc.1050.0158","volume":"19","author":"H.D. Sherali","year":"2007","unstructured":"Sherali H.D., Lim C.: Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability. INFORMS J. Comput. 19(1), 3\u201313 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"255_CR23","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800270310","volume":"27","author":"H.D. Sherali","year":"1980","unstructured":"Sherali H.D., Shetty C.M.: On the generation of deep disjunctive cutting planes. Nav. Res. Logist. Quart. 27(3), 453\u2013475 (1980)","journal-title":"Nav. Res. Logist. Quart."},{"key":"255_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with Disjunctive Constraints. Number 181 in Series in Economics and Mathematical Systems","author":"H.D. Sherali","year":"1980","unstructured":"Sherali H.D., Shetty C.M.: Optimization with Disjunctive Constraints. Number 181 in Series in Economics and Mathematical Systems. Springer, Berlin (1980)"},{"key":"255_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"H.D. Sherali","year":"1989","unstructured":"Sherali H.D., Ulular O.: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20, 193\u2013221 (1989)","journal-title":"Appl. Math. Optim."},{"key":"255_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Nondifferentiable Functions","author":"N.Z. Shor","year":"1985","unstructured":"Shor N.Z.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0255-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0255-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0255-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:26Z","timestamp":1559394686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0255-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0255-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]}}}