{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:44:20Z","timestamp":1648737860117},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11424-012-9324-0","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T07:47:58Z","timestamp":1356680878000},"page":"1080-1092","source":"Crossref","is-referenced-by-count":4,"title":["Multitask n-vehicle exploration problem: Complexity and algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Yangyang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jinchuan","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"key":"9324_CR1","first-page":"44","volume":"9","author":"R. Yang","year":"1999","unstructured":"R. Yang, A traffic problem with oil and its extension, Mathematical Communication, 1999, 9: 44\u201345 (in Chinese).","journal-title":"Mathematical Communication"},{"key":"9324_CR2","first-page":"444","volume":"8","author":"X. Y. Li","year":"2008","unstructured":"X. Y. Li and J. C. Cui, Efficient algorithm for a kind of exploration problem with n vehicles, Journal of System Engineering, 2008, 8: 444\u2013448.","journal-title":"Journal of System Engineering"},{"issue":"1","key":"9324_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10255-008-8811-5","volume":"26","author":"X. Xia","year":"2010","unstructured":"X. Xia and J. C. Cui, A method of estimating computational complexity based on input conditions for n-vehicle problem, Acta Mathematicae Applicatae Sinica (English Series), 2010, 26(1): 1\u201312.","journal-title":"Acta Mathematicae Applicatae Sinica (English Series)"},{"issue":"4","key":"9324_CR4","first-page":"72","volume":"12","author":"L. L. Liang","year":"2006","unstructured":"L. L. Liang, A problem of permutation optimization, Journal of Guangxi University for Nationalities, 2006, 12(4): 72\u201376 (in Chinese).","journal-title":"Journal of Guangxi University for Nationalities"},{"key":"9324_CR5","volume-title":"Scheduling Theory and Its Applications","author":"P. Chretienne","year":"1995","unstructured":"P. Chretienne, E. G. Coffman, J. K. Lenstra, and L. Zhen, Scheduling Theory and Its Applications, John Wiley & Sons, Chichester, 1995."},{"key":"9324_CR6","volume-title":"Graph Theory","author":"M. Russell","year":"2001","unstructured":"M. Russell, Graph Theory, John Wiley & Sons, New York, 2001."},{"key":"9324_CR7","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations, Kluwer, Netherlands, 2002."},{"key":"9324_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling Algorithm","author":"P. Brucker","year":"1998","unstructured":"P. Brucker, Scheduling Algorithm, Springer, Berlin, 1998."},{"issue":"2","key":"9324_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"N. Andelman, F. Michal, and M. Yishay, Strong price of anarchy, Games and Economic Behavior, 2009, 65(2): 289\u2013317.","journal-title":"Games and Economic Behavior"},{"key":"9324_CR10","unstructured":"F. Michal and T. Tami, Approximate strong equilibrium in Job Scheduling Games, Proceedings of the 1st International Symposium on Algorithmic Game Theory (ed. by B. Monien and U. P. Schroeder), Paderborn, 2008."},{"key":"9324_CR11","volume-title":"Complexity Theory","author":"I. Wegener","year":"2006","unstructured":"I. Wegener, Complexity Theory, Science Press, Beijing, 2006."},{"key":"9324_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman, New York, 1979."},{"key":"9324_CR13","volume-title":"Complexity of Computer Computations: The Proceedings of a Symposium on the Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"R. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations: The Proceedings of a Symposium on the Complexity of Computer Computations, (ed. by R. E. Miller and J. Thatcher), Plenum, New York, 1972."},{"issue":"2","key":"9324_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1511\/2002.2.113","volume":"90","author":"B. Hayes","year":"2002","unstructured":"B. Hayes, The easiest hard problem, American Scientist, 2002, 90(2): 113\u2013117.","journal-title":"American Scientist"},{"issue":"2","key":"9324_CR15","first-page":"125","volume":"125","author":"S. Mertens","year":"2006","unstructured":"S. Mertens, The easiest hard problem: Number partitioning, Computational Complexity and Statistical Physics, 2006, 125(2): 125\u2013140.","journal-title":"Computational Complexity and Statistical Physics"},{"issue":"4","key":"9324_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M. R. Garey","year":"1975","unstructured":"M. R. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Computing, 1975, 4(4): 397\u2013411.","journal-title":"SIAM J. Computing"},{"key":"9324_CR17","unstructured":"J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, United States Edition, 2005, 3."},{"key":"9324_CR18","volume-title":"Approximation Algorithm for NP-Hard Problem","author":"D. S. Hochbaum","year":"1997","unstructured":"D. S. Hochbaum, Approximation Algorithm for NP-Hard Problem, PWS Publishing Company, Boston, 1997."},{"key":"9324_CR19","volume-title":"Mathematical Analysis I","author":"V. A. Zorich","year":"2004","unstructured":"V. A. Zorich, Mathematical Analysis I, Springer, Berlin, 2004."},{"key":"9324_CR20","unstructured":"C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall Inc, 1982."},{"key":"9324_CR21","unstructured":"D. Z. Du, K. Ko, and J. Wang, Introduction to Computational Complexity, Higher Education Press, 2002."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-9324-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-012-9324-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-9324-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:04Z","timestamp":1559400844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-012-9324-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9324"],"URL":"https:\/\/doi.org\/10.1007\/s11424-012-9324-0","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}