{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:02Z","timestamp":1759847222453},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bf00127080","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T03:36:22Z","timestamp":1099539382000},"page":"247-259","source":"Crossref","is-referenced-by-count":34,"title":["A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems"],"prefix":"10.1007","volume":"1","author":[{"given":"A.","family":"Atamt\ufffdrk","sequence":"first","affiliation":[]},{"given":"G. L.","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"M. W. P.","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., and M., Padberg. (1976). ?Set Partitioning: A Survey.? SIAM Review 18, 710?760.","journal-title":"SIAM Review"},{"key":"CR2","series-title":"Technical Report COC-94-03","volume-title":"Branch-and-Price: Column Generation for Solving Integer Programs","author":"C. Barnhart","year":"1994","unstructured":"Barnhart, C., E.L., Johnson, G.L., Nemhauser, M.W.P., Savelsbergh, and P.H., Vance. (1994). ?Branch-and-Price: Column Generation for Solving Integer Programs.? Technical Report COC-94?03, Computational Optimization Center, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"CR3","first-page":"16","volume":"25","author":"R.E. Bixby","year":"1992","unstructured":"Bixby, R.E., E.A., Boyd, and R., Indovina. (1992). ?MIPLIB: A Test Set of Mixed-Integer Programming Problems.? SIAM News 25, 16.","journal-title":"SIAM News"},{"key":"CR4","series-title":"Technical report","volume-title":"A Genetic Algorithm for the Set Partitioning Problem","author":"P.C. Chu","year":"1995","unstructured":"Chu, P.C., and J.E., Beasley. (1995). ?A Genetic Algorithm for the Set Partitioning Problem.? Technical report, The Management School, Imperial College, London SW7 2AZ, England, April."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M. Fisher","year":"1990","unstructured":"Fisher, M., and P., Kedia. (1990). ?Optimal Solution of Set Covering\/Partitioning Problems Using Dual Heuristics.? Management Science 36, 674?688.","journal-title":"Management Science"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","volume":"17","author":"R.S. Garfinkel","year":"1969","unstructured":"Garfinkel, R.S., and G.L., Nemhauser. (1969). ?The Set-Partitioning Problem: Set Covering with Equality Constraints.? Operations Research 17, 848?856.","journal-title":"Operations Research"},{"key":"CR7","first-page":"667","volume":"39","author":"K. Hoffman","year":"1993","unstructured":"Hoffman, K., and M., Padberg. (1993). ?Solving Airline Crew-Scheduling Problems by Branch-and-Cut.? Management Science 39, 667?682.","journal-title":"Management Science"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/net.3230110208","volume":"11","author":"R.E. Marsten","year":"1981","unstructured":"Marsten, R.E., and F., Shepardson. (1981). ?Exact Solution of Crew Problems Using the Set Partitioning Mode: Recent Successful Applications.? Networks 11, 165?177.","journal-title":"Networks"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., M.W.P., Savelsbergh, and G.S., Sigismondi. (1994). ?MINTO: A Mixed Integer Optimizer.? Operations Research Letters 15, 47?58.","journal-title":"Operations Research Letters"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. Padberg","year":"1973","unstructured":"Padberg, M. (1973). ?On the Facial Structure of Set Packing Polyhedra.? Mathematical Programming 5, 199?215.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P. (1994). ?Preprocessing and Probing Techniques for Mixed Integer Programming Problems.? ORSA Journal on Computing 6, 445?454.","journal-title":"ORSA Journal on Computing"},{"key":"CR12","series-title":"Technical Report COC-91-03C","volume-title":"Functional Description of MINTO, a Mixed Integer Optimizer","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P. and G.L., Nemhauser. (1994). ?Functional Description of MINTO, a Mixed Integer Optimizer.? Technical Report COC-91?03C, Computational Optimization Center, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02099703","volume":"57","author":"D. Wedelin","year":"1995","unstructured":"Wedelin, D. (1995). ?An Algorithm for Large Scale 0?1 Integer Programming with Application to Airline Crew Scheduling.? Annals of Operations Research 57, 283?301.","journal-title":"Annals of Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00127080\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T04:48:54Z","timestamp":1554266934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00127080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996]]}},"alternative-id":["BF00127080"],"URL":"https:\/\/doi.org\/10.1007\/bf00127080","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}