{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:23:18Z","timestamp":1761488598611},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_13","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T06:12:57Z","timestamp":1292393577000},"page":"142-156","source":"Crossref","is-referenced-by-count":2,"title":["Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets"],"prefix":"10.1007","author":[{"given":"Yakov","family":"Zinder","sequence":"first","affiliation":[]},{"given":"Julia","family":"Memar","sequence":"additional","affiliation":[]},{"given":"Gaurav","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S.: Scheduling tasks with nonuniform deadlines on two processors. J. of ACM\u00a023, 461\u2013467 (1976)","journal-title":"J. of ACM"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J.K. Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res.\u00a026, 22\u201335 (1978)","journal-title":"Oper. Res."},{"key":"13_CR3","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. J. Comp. Syst. Sci.\u00a010, 384\u2013393 (1975)","journal-title":"J. Comp. Syst. Sci."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Zinder, Y.: The strength of priority algorithms. In: Proceedings, MISTA, pp. 531\u2013537 (2007)","DOI":"10.1016\/B978-012370861-8\/50021-8"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T22:57:23Z","timestamp":1559861843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}