{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:36:57Z","timestamp":1648813017810},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0305-0548(92)90005-p","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"505-519","source":"Crossref","is-referenced-by-count":1,"title":["A decomposition technique for mixed integer programming problems"],"prefix":"10.1016","volume":"19","author":[{"given":"Krishan","family":"Rana","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(92)90005-P_BIB1","series-title":"Routing and scheduling container ships using Langrangean relaxation and decomposition","author":"Rana","year":"1985"},{"key":"10.1016\/0305-0548(92)90005-P_BIB2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/trsc.10.1.52","article-title":"An optimization approach to routing aircraft","volume":"10","author":"Richardson","year":"1976","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(92)90005-P_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90005-P_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On the convergence rates of subgradient optimization methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(92)90005-P_BIB5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variables programming problems","volume":"4","author":"Benders","year":"1964","journal-title":"Num. Math."},{"key":"10.1016\/0305-0548(92)90005-P_BIB6","first-page":"163","article-title":"How can specialized discrete and convex optimization methods be married","volume":"1","author":"Geoffrion","year":"1977","journal-title":"Annl. Discrete Math."},{"key":"10.1016\/0305-0548(92)90005-P_BIB7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/trsc.22.2.83","article-title":"A model and solution algorithm for optimal routing of a time-chartered containership","volume":"22","author":"Rana","year":"1988","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(92)90005-P_BIB8","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":"Ops Res."},{"key":"10.1016\/0305-0548(92)90005-P_BIB9","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. Prog."},{"key":"10.1016\/0305-0548(92)90005-P_BIB10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Prog. Study"},{"key":"10.1016\/0305-0548(92)90005-P_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90005-P_BIB12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.23.5.453","article-title":"Parametric and post-optimality analysis in integer linear programming","volume":"23","author":"Geoffrion","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(92)90005-P_BIB13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","article-title":"A survey of Lagrangean techniques for discrete optimization","volume":"5","author":"Shapiro","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(92)90005-P_BIB14","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1287\/opre.27.6.1128","article-title":"A method of decomposition for integer programs","volume":"27","author":"Sweeney","year":"1979","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90005-P_BIB15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF02591718","article-title":"Cross-decomposition for mixed integer programming","volume":"25","author":"VanRoy","year":"1983","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(92)90005-P_BIB16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-5060(08)70747-7","article-title":"Implicit enumeration with generalized upper bounds","volume":"1","author":"Mevert","year":"1977","journal-title":"Annl. Discrete Math."},{"key":"10.1016\/0305-0548(92)90005-P_BIB17","first-page":"119","article-title":"A Langrangian algorithm for the multiple choice integer program","author":"Bean","year":"1984","journal-title":"Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290005P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290005P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:23:17Z","timestamp":1552915397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489290005P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["030505489290005P"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(92)90005-p","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}