{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:08:43Z","timestamp":1794344923561,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405054","type":"print"},{"value":"9783540450665","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_21","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"265-277","source":"Crossref","is-referenced-by-count":6,"title":["An Analysis of Quantified Linear Programs"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","volume":"5","author":"R.P. Anstee","year":"1984","unstructured":"R.P. Anstee and M. Farber. Characterizations of totally balanced matrices. J. Algorithms, 5:215\u2013230, 1984.","journal-title":"J. Algorithms"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0097-3165(80)90008-4","volume":"29","author":"R.P. Anstee","year":"1980","unstructured":"R.P. Anstee. Properties of (0,1)-matrices with no triangles. J. of Combinatorial Theory (A), 29:186\u2013198, 1980.","journal-title":"J. of Combinatorial Theory (A)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"G. B. Dantzig","year":"1973","unstructured":"G. B. Dantzig and B. C. Eaves. Fourier-Motzkin Elimination and its Dual. Journal of Combinatorial Theory (A), 14:288\u2013297, 1973.","journal-title":"Journal of Combinatorial Theory (A)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"R. Gerber, W. Pugh, and M. Saksena. Parametric Dispatching of Hard Real-Time Tasks. IEEE Transactions on Computers, 1995.","DOI":"10.1109\/12.372041"},{"key":"21_CR5","unstructured":"Neil Immerman. Personal Communication."},{"key":"21_CR6","unstructured":"D.S. Johnson. Personal Communication."},{"key":"21_CR7","volume-title":"Integer and Combinatorial Optimization","author":"G. L. Nemhauser","year":"1999","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1999."},{"key":"21_CR8","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, 1994."},{"key":"21_CR9","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1987."},{"key":"21_CR10","volume-title":"Duality in the Parametric Polytope and its Applications to a Scheduling Problem","author":"K. Subramani","year":"2000","unstructured":"K. Subramani. Duality in the Parametric Polytope and its Applications to a Scheduling Problem. PhD thesis, University of Maryland, College Park, August 2000."},{"key":"21_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-36137-5_14","volume-title":"Proceedings of the 29thAnnual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM)","author":"K. Subramani","year":"2002","unstructured":"K. Subramani. A specification framework for real-time scheduling. In W.I. Grosky and F. Plasil, editors, Proceedings of the 29th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), volume 2540 of Lecture Notes in Computer Science, pages 195\u2013207. Springer-Verlag, Nov. 2002."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"V. Chandru and M.R. Rao. Linear programming. In Algorithms and Theory of Computation Handbook, CRC Press, 1999. CRC Press, 1999.","DOI":"10.1201\/9781420049503-c32"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:18:36Z","timestamp":1556137116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/3-540-45066-1","asserted-by":"object"}]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}