{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:00:09Z","timestamp":1648850409606},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T00:00:00Z","timestamp":1365206400000},"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":[[2014,3]]},"DOI":"10.1007\/s11590-013-0637-2","type":"journal-article","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T03:31:47Z","timestamp":1365132707000},"page":"1093-1099","source":"Crossref","is-referenced-by-count":2,"title":["Approximation algorithms for $$k$$ -partitioning problems with partition matroid constraint"],"prefix":"10.1007","volume":"8","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,6]]},"reference":[{"key":"637_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01193837","volume":"47","author":"L Babel","year":"1998","unstructured":"Babel, L., Kellerer, H., Kotov, V.: The $$k$$ -partitioning problem. Math. Methods Oper. Res. 47, 59\u201382 (1998)","journal-title":"Math. Methods Oper. Res."},{"key":"637_CR2","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.dam.2005.05.036","volume":"154","author":"M Bruglieri","year":"2006","unstructured":"Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Appl. Math. 154, 1344\u20131357 (2006)","journal-title":"Discrete Appl. Math."},{"key":"637_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1013370208101","volume":"6","author":"S Chen","year":"2002","unstructured":"Chen, S., He, Y., Lin, G.: 3-partitioning for maximizing the minimum load. J. Comb. Optim. 6, 67\u201380 (2002)","journal-title":"J. Comb. Optim."},{"key":"637_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/B:HEUR.0000026266.07036.da","volume":"10","author":"M Dell\u2019Amico","year":"2004","unstructured":"Dell\u2019Amico, M., Iori, M., Martello, S.: Heuristic algorithms and scatter search for the cardinality constrained $$P|| C_{max}$$ problem. J. Heuristics 10, 169\u2013204 (2004)","journal-title":"J. Heuristics"},{"key":"637_CR5","unstructured":"Dell\u2019Amico, M., Iori, M., Martello, S., Monaci, M.: Lower bound and heuristic algorithms for the $$k_i$$ partitioning problem. Eur. J. Oper. Res. 171, 725\u2013742 (2006)"},{"key":"637_CR6","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Martello, S.: Bounds for the cardinality constrained $$P||C_{max}$$ problem. J. Sched. 4, 123\u2013138 (2001)","DOI":"10.1002\/jos.68"},{"key":"637_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.dam.2005.02.013","volume":"150","author":"P Dell\u2019 Olmo","year":"2005","unstructured":"Dell\u2019 Olmo, P., Hansen, P., Pallottino, S., Storchi, G.: On uniform $$k$$ -partition problems. Discrete Appl. Math. 150, 121\u2013139 (2005)","journal-title":"Discrete Appl. Math."},{"key":"637_CR8","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1016\/S0898-1221(03)90201-X","volume":"46","author":"Y He","year":"2003","unstructured":"He, Y., Tan, Z., Zhu, J., Yao, E.: $$k$$ -Partitioning problems for maximizing the minimum load. Comput. Math. Appl. 46, 1671\u20131681 (2003)","journal-title":"Comput. Math. Appl."},{"key":"637_CR9","first-page":"48","volume":"37","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Kotov, V.: A $$\\frac{7}{6}$$ -approximation algorithm for 3-partitioning and its application to multiprocessor scheduling. INFOR 37, 48\u201356 (1999)","journal-title":"INFOR"},{"key":"637_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0166-218X(93)90013-E","volume":"45","author":"H Kellerer","year":"1993","unstructured":"Kellerer, H., Woeginger, G.: A tight bound for 3-partitioning. Discrete Appl. Math. 45, 249\u2013259 (1993)","journal-title":"Discrete Appl. Math."},{"key":"637_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"637_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2006.11.016","volume":"374","author":"B Wu","year":"2007","unstructured":"Wu, B., Yao, E.: $$k$$ -Partitioning problems with partition matroid constraint. Theor. Comput. Sci. 374, 41\u201348 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"637_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11766-008-0101-8","volume":"23","author":"B Wu","year":"2008","unstructured":"Wu, B., Yao, E.: Lower bounds and modified LPT algorithm for $$k$$ -partitioning problems with partition matroid constraint. Appl. Math. J. Chin. Univ. 23, 1\u20138 (2008)","journal-title":"Appl. Math. J. Chin. Univ."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0637-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0637-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0637-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:36Z","timestamp":1559394696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0637-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["637"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0637-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,6]]}}}