{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T01:53:57Z","timestamp":1767664437199},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":[[1978,1]]},"DOI":"10.1016\/0305-0548(78)90018-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"55-71","source":"Crossref","is-referenced-by-count":56,"title":["On obtaining the \u2018best\u2019 multipliers for a lagrangean relaxation for integer programming"],"prefix":"10.1016","volume":"5","author":[{"given":"Bezalel","family":"Gavish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(78)90018-7_BIB1","series-title":"An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem","author":"Akinc","year":"1974"},{"key":"10.1016\/0305-0548(78)90018-7_BIB2","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1287\/opre.24.4.742","article-title":"An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks","volume":"24","author":"Balachandran","year":"1976","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB3","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1287\/opre.14.6.1149","article-title":"Finding Everett's Lagrange Multipliers by Linear Programming","volume":"14","author":"Brooks","year":"1966","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB4","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1287\/opre.19.6.1406","article-title":"An All Zero-One Algorithm for a Certain Class of Transportation Problems","volume":"19","author":"Demaio","year":"1971","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","article-title":"Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources","volume":"11","author":"Everett","year":"1963","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB6","series-title":"Municipal Bond Coupon Schedules with Limitations on the Number of Different Coupon Values","author":"Gavish","year":"1977"},{"key":"10.1016\/0305-0548(78)90018-7_BIB7","article-title":"How Can Specialized Discrete and Convex Optimization Methods be Married","author":"Geoffrion","year":"1975"},{"key":"10.1016\/0305-0548(78)90018-7_BIB8","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. Programming Study"},{"key":"10.1016\/0305-0548(78)90018-7_BIB9","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","article-title":"Multicommodity Distribution System Design by Benders Decomposition","volume":"20","author":"Geoffrion","year":"1974","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(78)90018-7_BIB10","series-title":"Proc. IFIP Cong.","first-page":"73","article-title":"The Construction of Class-Teacher Timetables","author":"Gotlieb","year":"1962"},{"key":"10.1016\/0305-0548(78)90018-7_BIB11","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. Prog."},{"key":"10.1016\/0305-0548(78)90018-7_BIB12","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.14.6.1130","article-title":"Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method","volume":"14","author":"Kaplan","year":"1966","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","article-title":"Three Problems in Capital Rationing","volume":"28","author":"Lorie","year":"1955","journal-title":"J. Business"},{"key":"10.1016\/0305-0548(78)90018-7_BIB14","article-title":"An Efficient Algorithm for the Capacitated Facility Location Problem","author":"Nauss","year":"1975"},{"key":"10.1016\/0305-0548(78)90018-7_BIB15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.16.2.450","article-title":"A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem","volume":"16","author":"Nemhauser","year":"1968","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A Branch and Bound Algorithm for the Generalized Assignment Problem","volume":"8","author":"Ross","year":"1975","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(78)90018-7_BIB17","article-title":"Modelling Facility Location Problems as Generalized Assignment Problems","author":"Ross","year":"1976"},{"key":"10.1016\/0305-0548(78)90018-7_BIB18","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1287\/opre.17.6.1005","article-title":"Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem","volume":"17","author":"Sa","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.19.1.68","article-title":"Generalized Lagrange Multipliers in Integer Programming","volume":"19","author":"Shapiro","year":"1971","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(78)90018-7_BIB20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/360715.360725","article-title":"On Maintenance of the Opportunity List for Class-Teacher Timetable Problems","volume":"18","author":"Smith","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(78)90018-7_BIB21","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/mnsc.19.4.369","article-title":"Municipal Bond Coupon Schedules with Limitations on the Number of Coupons","volume":"19","author":"Weingartner","year":"1972","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(78)90018-7_BIB22","series-title":"Mathematical Programming and the Analysis of Capital Budgeting Problems","author":"Weingartner","year":"1963"},{"key":"10.1016\/0305-0548(78)90018-7_BIB23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","article-title":"Methods for the solution of 0\u20131 Knapsack Problems","volume":"15","author":"Weingartner","year":"1967","journal-title":"Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054878900187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054878900187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:26:15Z","timestamp":1552926375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054878900187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["0305054878900187"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(78)90018-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}