{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:29:29Z","timestamp":1649075369083},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1983,9]]},"DOI":"10.1007\/bf02263431","type":"journal-article","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T12:38:23Z","timestamp":1134045503000},"page":"203-209","source":"Crossref","is-referenced-by-count":2,"title":["A heuristic partitioning algorithm for a packaging problem"],"prefix":"10.1007","volume":"31","author":[{"given":"M. B.","family":"Korchemkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02263431_CR1","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1287\/opre.19.6.1406","volume":"19","author":"A. Maio De","year":"1971","unstructured":"De Maio, A., Roveda, C.: An all zero-one algorithm for a certain class of transportation problems. Oper. Res.19, 1406\u20131418 (1971).","journal-title":"Oper. Res."},{"key":"BF02263431_CR2","volume-title":"Integer Programming and Network Flows","author":"T. C. Hu","year":"1970","unstructured":"Hu, T. C.: Integer Programming and Network Flows. London: Addison-Wesley 1970."},{"key":"BF02263431_CR3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/nav.3800270309","volume":"27","author":"J. Intrator","year":"1980","unstructured":"Intrator, J., Berrebi, M.: Auxiliary Procedures for Solving Long Transportation Problems. NRLQ27, 447\u2013452 (1980).","journal-title":"NRLQ"},{"key":"BF02263431_CR4","first-page":"317","volume":"28","author":"M. Korchemkin","year":"1979","unstructured":"Korchemkin, M.: The piecewise solution of a certain class of transportation problems. Eesti NSV TA Toimetised. F\u00fc\u00fcsika & Matem.28, 317\u2013324 (1979).","journal-title":"Eesti NSV TA Toimetised. F\u00fc\u00fcsika & Matem."},{"key":"BF02263431_CR5","volume-title":"Diakoptics","author":"G. Kron","year":"1963","unstructured":"Kron, G.: Diakoptics. London: MacDonald 1963."},{"key":"BF02263431_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0305-0548(80)90005-2","volume":"7","author":"R. V. Nagelhout","year":"1980","unstructured":"Nagelhout, R. V., Tompson, G. L.: A single source transportation algorithm. Comput. & Oper. Res.7, 185\u2013198 (1980).","journal-title":"Comput. & Oper. Res."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02263431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02263431\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02263431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:16:57Z","timestamp":1558005417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02263431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["BF02263431"],"URL":"https:\/\/doi.org\/10.1007\/bf02263431","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}