{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T11:22:12Z","timestamp":1714130532389},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s13675-017-0088-0","type":"journal-article","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T17:27:04Z","timestamp":1501090024000},"page":"55-83","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming"],"prefix":"10.1016","volume":"6","author":[{"given":"DimitriJ.","family":"Papageorgiou","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Trespalacios","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","article-title":"Branching rules revisited","volume":"33","author":"Achterberg","year":"2005","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-017-0088-0_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann Discrete Math"},{"issue":"3","key":"10.1007\/s13675-017-0088-0_CR3","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","article-title":"Disjunctive programming and a hierarchy of relaxations for discrete optimization problems","volume":"6","author":"Balas","year":"1985","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","article-title":"Disjunctive programming: properties of the convex hull of feasible points","volume":"89","author":"Balas","year":"1998","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-017-0088-0_CR5","series-title":"Disjunctive programming","author":"Balas","year":"2010"},{"issue":"1-3","key":"10.1007\/s13675-017-0088-0_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0-1 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0088-0_CR7","doi-asserted-by":"crossref","unstructured":"Belotti P, Bonami P, Fischetti M, Lodi A, Monaci M, Nogales-G\u00f3mez A, Salvagnin D (2016) On handling indicator constraints in mixed integer programming. Comput Optim Appl 65(3):545\u2013566","DOI":"10.1007\/s10589-016-9847-8"},{"key":"10.1007\/s13675-017-0088-0_CR8","series-title":"Lectures on modern convex optimization: analysis, algorithms, and engineering applications","author":"Ben-Tal","year":"2001"},{"key":"10.1007\/s13675-017-0088-0_CR9","series-title":"Nonlinear programming","author":"Bertsekas","year":"1999"},{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","article-title":"On mathematical programming with indicator constraints","volume":"151","author":"Bonami","year":"2015","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-017-0088-0_CR11","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","article-title":"Convex programming for disjunctive convex optimization","volume":"86","author":"Ceria","year":"1999","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0088-0_CR12","doi-asserted-by":"crossref","unstructured":"Fischetti M, Lodi A, Salvagnin D (2010) Just MIP it! In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Boston, pp 39\u201370","DOI":"10.1007\/978-1-4419-1306-7_2"},{"issue":"9","key":"10.1007\/s13675-017-0088-0_CR13","doi-asserted-by":"crossref","first-page":"3276","DOI":"10.1002\/aic.14088","article-title":"Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming","volume":"59","author":"Grossmann","year":"2013","journal-title":"AIChE J"},{"issue":"2","key":"10.1007\/s13675-017-0088-0_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","article-title":"Lagrangean relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"Top"},{"key":"10.1007\/s13675-017-0088-0_CR15","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988"},{"key":"10.1007\/s13675-017-0088-0_CR16","series-title":"Generating cuts from multiple-term disjunctions","author":"Perregaard","year":"2001"},{"issue":"7","key":"10.1007\/s13675-017-0088-0_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","article-title":"Modelling and computational techniques for logic based integer programming","volume":"18","author":"Raman","year":"1994","journal-title":"Comput Chem Eng"},{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2011.10.002","article-title":"A hierarchy of relaxations for nonlinear convex generalized disjunctive programming","volume":"218","author":"Ruiz","year":"2012","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-017-0088-0_CR19","unstructured":"Sawaya N (2006) Reformulations, relaxations and cutting planes for generalized disjunctive programming. Ph.D. thesis"},{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR20","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2011.07.018","article-title":"A hierarchy of relaxations for linear generalized disjunctive programming","volume":"216","author":"Sawaya","year":"2012","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0088-0_CR21","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","article-title":"A branch-and-cut method for 0-1 mixed convex programming","volume":"86","author":"Stubbs","year":"1999","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-017-0088-0_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/ijoc.2014.0610","article-title":"Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs","volume":"27","author":"Trespalacios","year":"2014","journal-title":"INFORMS J Comput"},{"issue":"2","key":"10.1007\/s13675-017-0088-0_CR23","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ejor.2016.02.048","article-title":"Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound","volume":"253","author":"Trespalacios","year":"2016","journal-title":"Eur J Oper Res"},{"issue":"1-2","key":"10.1007\/s13675-017-0088-0_CR24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","article-title":"Modeling disjunctive constraints with a logarithmic number of binary variables and constraints","volume":"128","author":"Vielma","year":"2011","journal-title":"Math Program"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0088-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0088-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000952?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000952?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0088-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:23:56Z","timestamp":1648632236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S2192440621000952"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0088-0","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}