{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:27Z","timestamp":1725496467549},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668565"},{"type":"electronic","value":"9783540466741"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46674-6_37","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T15:50:17Z","timestamp":1196351417000},"page":"383-385","source":"Crossref","is-referenced-by-count":0,"title":["On Feasibility, Boundedness and Redundancy of Systems of Linear Constraints over R 2-Plane"],"prefix":"10.1007","author":[{"given":"Nguyen","family":"Duc Quang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"37_CR1","unstructured":"Lassez, J.L. & Maher, M.J. (1988) On Fourier\u2019s Algorithm for Linear Arithmetic Constraints, IBM Research Report, IBM T.J. Watson Research Center."},{"key":"37_CR2","unstructured":"Lassez, J.L., Huynh, T. and Mcalloon (1989), K. Simplification and Elimination of Redundant Arithmetic Constraints, Proc. of NACLP 89, MIT Press."},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M.E. Dyer","year":"1984","unstructured":"Dyer M.E. (1984), Linear Time Algorithms for Two-and Three-variable Linear Programs, SIAM J. Comp. 13(1), 31\u201345.","journal-title":"SIAM J. Comp"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo N. (1983), Linear Time Algorithm for Linear Programming in R3 and Related Problems, SIAM J. Comp. 12(4), 759\u2013776.","journal-title":"SIAM J. Comp"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46674-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:56:37Z","timestamp":1551142597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46674-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668565","9783540466741"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-46674-6_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}