{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:26:26Z","timestamp":1743150386239,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_462","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:11:28Z","timestamp":1219662688000},"page":"2675-2682","source":"Crossref","is-referenced-by-count":2,"title":["NP-complete Problems and Proof Methodology"],"prefix":"10.1007","author":[{"given":"Sanatan","family":"Rai","sequence":"first","affiliation":[]},{"given":"George","family":"Vairaktarakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"462_CR1_462","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T.C.E. Cheng","year":"1990","unstructured":"Cheng TCE, Sin CCS (1990) A\u00a0state-of-the-art review of parallel-machine scheduling research. Europ J Oper Res 47:271\u2013292","journal-title":"Europ. J. Oper. Res."},{"key":"462_CR2_462","first-page":"151","volume-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing","author":"SA Cook","year":"1971","unstructured":"Cook SA (1971) The complexity of theorem proving procedures. In: Proc. 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, pp\u00a0151\u2013158"},{"key":"462_CR3_462","first-page":"227","volume-title":"On two problems in the generation of program test paths","author":"H.N. Gabow","year":"1976","unstructured":"Gabow HN, Maheshwari SN, Osterweil L (1976) On two problems in the generation of program test paths. IEEE Trans. Software Engin., London, pp\u00a0227\u2013231"},{"key":"462_CR4_462","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York"},{"key":"462_CR5_462","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp\u00a085\u2013103"},{"key":"462_CR6_462","series-title":"Logistics of Production and Inventory","first-page":"445","volume-title":"Handbook Oper. Res. and Management Sci.","author":"E.L. Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P (eds) Handbook Oper. Res. and Management Sci.: Logistics of Production and Inventory. North-Holland, Amsterdam, pp\u00a0445\u2013522"},{"key":"462_CR7_462","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann. Discret Math."},{"key":"462_CR8_462","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: Algorithms and computer implementations. Wiley, New York"},{"key":"462_CR9_462","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:01:26Z","timestamp":1720692086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_462","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}