{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:30:53Z","timestamp":1772357453209,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T00:00:00Z","timestamp":1220400000000},"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":[[2009,1]]},"DOI":"10.1007\/s11590-008-0097-2","type":"journal-article","created":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T11:25:51Z","timestamp":1220354751000},"page":"123-136","source":"Crossref","is-referenced-by-count":26,"title":["Complementary column generation and bounding approaches for set partitioning formulations"],"prefix":"10.1007","volume":"3","author":[{"given":"Ahmed","family":"Ghoniem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,3]]},"reference":[{"key":"97_CR1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart C., Johnson E., Nemhauser G., Savelsbergh M., Vance P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46, 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"97_CR2","unstructured":"Beasley, J.E.: Bin packing benchmark instances, at the Brunell University OR-Library. Available at: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"97_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","volume":"51","author":"J. Blazewicz","year":"1991","unstructured":"Blazewicz J., Dror M., Weglarz J.: Mathematical programming formulations for machine scheduling: a survey. Eur. J. Oper. Res. 51, 283\u2013300 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"97_CR4","unstructured":"Boysen, N., Fliedner, M., Scholl, A.: Sequencing mixed-model assembly lines: survey, classification and model critique. Eur. J. Oper. Res. Available online 17 September (2007, in press)"},{"key":"97_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J.M. Val\u00e9riode Carvalho","year":"2002","unstructured":"Val\u00e9riode Carvalho J.M.: LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141, 253\u2013273 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"97_CR6","volume-title":"Column Generation","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers J., L\u00fcbbecke M.E.: A primer in column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation, Springer, Germany (2005)"},{"key":"97_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-5060(08)70725-8","volume":"1","author":"E. Balas","year":"1977","unstructured":"Balas E.: Some valid inequalities for the set partitioning problem. Ann. Discrete Math. 1, 13\u201347 (1977)","journal-title":"Ann. Discrete Math."},{"key":"97_CR8","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas E., Padberg M.W.: Set partitioning: a survey. SIAM Rev. 18, 710\u2013760 (1976)","journal-title":"SIAM Rev."},{"key":"97_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1994","unstructured":"Falkenauer E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2, 5\u201330 (1994)","journal-title":"J. Heuristics"},{"key":"97_CR10","unstructured":"Ghoniem, A., Sherali, H.D.: Set partitioning\/packing versus assignment formulations for subassembly matching problems. Manuscript, Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, 24061 (2007)"},{"issue":"6","key":"97_CR11","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M.E. L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke M.E., Desrosiers J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"key":"97_CR12","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization, 2nd edn. Wiley-Interscience, New York (1999)","edition":"2"},{"key":"97_CR13","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/0377-2217(88)90233-0","volume":"35","author":"D.M. Ryan","year":"1988","unstructured":"Ryan D.M., Falkner J.C.: On the integer properties of scheduling set partitioning models. Eur. J. Oper. Res. 35, 442\u2013456 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"97_CR14","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"1997","unstructured":"Savelsbergh M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45, 831\u2013841 (1997)","journal-title":"Oper. Res."},{"key":"97_CR15","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, 83\u2013106 (1994)","journal-title":"Discrete Appl. Math."},{"key":"97_CR16","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Ghoniem, A.: Joint vehicle assembly-routing problems: An integrated modeling and optimization approach. Networks (to appear)","DOI":"10.1002\/net.20268"},{"key":"97_CR17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"H.D. Sherali","year":"1996","unstructured":"Sherali H.D., Lee Y.: Tighter representations for set partitioning problems. Discrete Appl. Math. 68, 153\u2013167 (1996)","journal-title":"Discrete Appl. Math."},{"key":"97_CR18","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali H.D., Smith J.C.: Improving discrete model representations via symmetry considerations. Manage. Sci. 47, 1396\u20131407 (2001)","journal-title":"Manage. Sci."},{"key":"97_CR19","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0097-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-008-0097-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-008-0097-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:03Z","timestamp":1559574903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-008-0097-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s11590-008-0097-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,3]]}}}