乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T09:47:32Z","timestamp":1743328052139},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00429-3","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"215-231","source":"Crossref","is-referenced-by-count":3,"title":["On a 2-dimensional equipartition problem"],"prefix":"10.1016","volume":"113","author":[{"given":"Francesco","family":"Conti","sequence":"first","affiliation":[]},{"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[]},{"given":"Sara","family":"Nicoloso","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00429-3_BIB1","doi-asserted-by":"crossref","unstructured":"Becker, R.I., Lari, I., Lucertini, M., Simeone, B., 1997. Max-min partitioning of grids into connected components. Networks (to appear)","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0196-6774(83)90039-1","article-title":"A shifting algorithm for tree partitioning with general weighting functions","volume":"4","author":"Becker","year":"1983","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322290.322294","article-title":"A shifting algorithm for min-max tree partitioning","volume":"29","author":"Becker","year":"1982","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB4","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1215\/S0012-7094-40-00718-9","article-title":"The dissection of rectangles into squares","volume":"7","author":"Brooks","year":"1940","journal-title":"Duke Mathematical Journal"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB5","doi-asserted-by":"crossref","unstructured":"Carraresi, P., Malucelli, F., Sandi, C., 1994. Partitioning the service period into uniform time shifts through network flow algorithms. Dipartimento di Informatica, Universit\u00e0 di Pisa, TR-21\/94","DOI":"10.1090\/dimacs\/016\/06"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230200305","article-title":"Fair dissection of spiders, worms and caterpillars","volume":"20","author":"De Simone","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB7","unstructured":"Garey, M.R., Johnson, D.S., 1979. Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum covering, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu Search (part I)","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu Search (part II)","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB11","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0166-218X(91)90011-K","article-title":"Approximation algorithms for hitting objects with straight lines","volume":"30","author":"Hassin","year":"1991","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0206012","article-title":"A linear tree-partitioning algorithm","volume":"6","author":"Kundu","year":"1977","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","article-title":"Most uniform path partitioning and its use in image processing","volume":"42","author":"Lucertini","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(94)00154-6","article-title":"Partitioning a matrix to minimize the maximum cost","volume":"62","author":"Mingozzi","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB17","unstructured":"Mizoguchi, T., 1976. Finding the k-th pair (unpublished manuscript)"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max-min tree partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0166-218X(85)90041-1","article-title":"Efficient implementation of a shifting algorithm","volume":"12","author":"Perl","year":"1985","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB20","doi-asserted-by":"crossref","unstructured":"Riehme, Scheithauer, G., Terno, J., 1996. The solution of two-stage guillotine cutting stock problems having extremely varying order demands. European Journal of Operational Research 91, 543\u2013552","DOI":"10.1016\/0377-2217(95)00200-6"},{"key":"10.1016\/S0377-2217(97)00429-3_BIB21","unstructured":"Shamos, M.I., 1976. Geometry and Statistics: Problems at the Interface. In: Traub, J.F. (Ed.), Recent results and new directions in algorithms and complexity. Academic Press, New York, pp. 251\u2013280"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004293?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:42:52Z","timestamp":1578876172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0377221797004293"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00429-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}