{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:35:45Z","timestamp":1767864945518,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262244","type":"print"},{"value":"9783540324409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_43","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"400-410","source":"Crossref","is-referenced-by-count":1,"title":["On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[]},{"given":"Fenghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"43_CR2","unstructured":"Cesati, M.: Compendium of parameterized problems, Department of Computer Science, Systems, and Industrial Engineering, University of Rome \u201cTor Vergata\u201d, Available at \n                    \n                      http:\/\/bravo.ce.uniroma2.it\/home\/cesati\/research\/compendium.pdf"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s11390-005-0003-7","volume":"20","author":"J. Chen","year":"2005","unstructured":"Chen, J.: Parameterized computation and complexity: a new approach dealing with NP-hardness. Journal of Computer Science & Technology\u00a020, 18\u201337 (2005)","journal-title":"Journal of Computer Science & Technology"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT reductions and computational lower bounds. In: Proc. 36th ACM Symp. on Theory of Computing (STOC 2004), pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"43_CR6","unstructured":"Chen, J., Zhang, F.: On product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4], Technical Report No 2005-3-2, Dept. of Computer Science, Texas A&M University (2005), \n                    \n                      http:\/\/www.cs.tamu.edu\/academics\/tr\/tamu-cs-tr-2005-3-2"},{"key":"43_CR7","volume-title":"Supply Chain Management: Strategy, Planning, and Operations","author":"S. Chopra","year":"2001","unstructured":"Chopra, S., Meindl, P.: Supply Chain Management: Strategy, Planning, and Operations. Prentice-Hall, Upper Saddle River (2001)"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1108\/09574099710805556","volume":"8","author":"M.C. Cooper","year":"1997","unstructured":"Cooper, M.C., Lambert, D.M., Pagh, J.D.: Supply Chain Management: More Than a New Name for Logistics. The International Journal of Logistics Management\u00a08(1), 1\u201313 (1997)","journal-title":"The International Journal of Logistics Management"},{"key":"43_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/net.10082","volume":"42","author":"J. Genues","year":"2003","unstructured":"Genues, J., Pardalos, P.: Network optimization in supply chain management and financial engineering: an annotated bibliography. Networks\u00a042(2), 66\u201384 (2003)","journal-title":"Networks"},{"key":"43_CR11","series-title":"Kluwer Series in Applied Optimization","volume-title":"Supply Chain Management: Models, Applications, and Research Directions","year":"2002","unstructured":"Genues, J., Pardalos, P., Romeijn, H. (eds.): Supply Chain Management: Models, Applications, and Research Directions. Kluwer Series in Applied Optimization, vol.\u00a062. Kluwer, Dordrecht (2002)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S1366-5545(02)00036-4","volume":"39","author":"M. Khouja","year":"2003","unstructured":"Khouja, M.: Optimizating inventory decisions in multi-stage multi-customer supply chain. Transportation Research Part E\u00a039, 193\u2013208 (2003)","journal-title":"Transportation Research Part E"},{"key":"43_CR13","unstructured":"Nagurney, A., Toyasaki, F.: Reverse supply chain management and electronic waste recycling: a multitiered network equilibrium framework for e-cycling, Transportation Research D (2003) (in press)"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0360-8352(02)00066-9","volume":"43","author":"H. Min","year":"2002","unstructured":"Min, H., Zhou, G.: Supply chain modeling: past, present and future. Computers & Industrial Engineering\u00a043, 231\u2013249 (2002)","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"43_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/582475.582484","volume":"33","author":"M. Sch\u00e4fer","year":"2002","unstructured":"Sch\u00e4fer, M., Umans, C.: Completeness in the polynomial-time hierarchy: part I: a compendium. SIGACT News\u00a033(3), 32\u201349 (2002)","journal-title":"SIGACT News"},{"issue":"4","key":"43_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/601819.601829","volume":"33","author":"M. Sch\u00e4fer","year":"2002","unstructured":"Sch\u00e4fer, M., Umans, C.: Completeness in the polynomial-time hierarchy: part II. SIGACT News\u00a033(4), 22\u201336 (2002)","journal-title":"SIGACT News"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S1366-5545(03)00018-8","volume":"39","author":"J. Sheu","year":"2003","unstructured":"Sheu, J.: Locating manufacturing and distribution centers: an integrated supply chai-based spatial interaction approach. Transportation Research Part E\u00a039, 381\u2013397 (2003)","journal-title":"Transportation Research Part E"},{"key":"43_CR18","volume-title":"Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies","author":"D. Simchi-Levi","year":"2000","unstructured":"Simchi-Levi, D., Kaminsky, P., Simchi-Levi, E.: Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies. Irwin McGraw-Hill, Boston (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:00Z","timestamp":1619505600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11496199_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}