{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:35:30Z","timestamp":1794335730335,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223450","type":"print"},{"value":"9783540259848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25984-8_26","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:31:38Z","timestamp":1284172298000},"page":"342-356","source":"Crossref","is-referenced-by-count":14,"title":["Analyzing Selected Quantified Integer Programs"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"key":"26_CR3","unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: AAAI 1998 (July 1998)"},{"key":"26_CR4","series-title":"Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033166","volume-title":"Optimization Methods for Logical Inference","author":"V. Chandru","year":"1999","unstructured":"Chandru, V., Hooker, J.N.: Optimization Methods for Logical Inference. Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1999)"},{"issue":"6","key":"26_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0020-0190(93)90038-B","volume":"45","author":"F. Gavril","year":"1993","unstructured":"Gavril, F.: An efficiently solvable graph partition, problem to which many problems are reducible. Information Processing Letters\u00a045(6), 285\u2013290 (1993)","journal-title":"Information Processing Letters"},{"key":"26_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, San Francisco (1979)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Naor, J.(Seffi).: Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing\u00a023(6), 1179\u20131192 (1994)","DOI":"10.1137\/S0097539793251876"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D.S. Hirschberg","year":"1976","unstructured":"Hirschberg, D.S., Wong, C.K.: A polynomial algorithm for the knapsack problem in 2 variables. JACM\u00a023(1), 147\u2013154 (1976)","journal-title":"JACM"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Iwata, S., Matsui, T., McCormick, S.T.: A fast bipartite network flow algorithm for selective assembly. OR Letters, 137\u2013143 (1998)","DOI":"10.1016\/S0167-6377(98)00017-0"},{"key":"26_CR10","unstructured":"Johnson, D.S.: Personal Communication"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R. Kannan","year":"1980","unstructured":"Kannan, R.: A polynomial algorithm for the two-variable integer programming problem. JACM\u00a027(1), 118\u2013122 (1980)","journal-title":"JACM"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The computational complexity of simultaneous Diophantine approximation problems. SIAM Journal on Computing\u00a014(1), 196\u2013209 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1287\/opre.47.5.744","volume":"47","author":"S.T. McCormick","year":"2000","unstructured":"McCormick, S.T.: Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Operations Research\u00a047, 744\u2013756 (2000)","journal-title":"Operations Research"},{"key":"26_CR14","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, New York (1999)"},{"key":"26_CR15","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"26_CR16","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"26_CR17","unstructured":"Pugh, W.: The definition of dependence distance. Technical Report CSTR-2292, Dept. of Computer Science, Univ. of Maryland, College Park (November 1992)"},{"issue":"8","key":"26_CR18","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The omega test: A fast and practical integer programming algorithm for dependence analysis. Comm. of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Comm. of the ACM"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/288086.288088","volume":"23","author":"P. Revesz","year":"1998","unstructured":"Revesz, P.: Safe query languages for constraint databases. ACM Transactions on Database Systems\u00a023(1), 58\u201399 (1998)","journal-title":"ACM Transactions on Database Systems"},{"issue":"5","key":"26_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0218196798000260","volume":"8","author":"P. Revesz","year":"1998","unstructured":"Revesz, P.: The evaluation and the computational complexity of datalog queries of boolean constraints. International Journal of Algebra and Computation\u00a08(5), 553\u2013574 (1998)","journal-title":"International Journal of Algebra and Computation"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-49481-2_26","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Revesz","year":"1998","unstructured":"Revesz, P.: Safe datalog queries with linear constraints. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 355\u2013369. Springer, Heidelberg (1998)"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York City (1978)"},{"key":"26_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)"},{"key":"26_CR24","volume-title":"Deadline Scheduling for Real-Time Systems","year":"1998","unstructured":"Stankovic, J.A., Spuri, M., Ramamritham, K., Buttazzo, G.C. (eds.): Deadline Scheduling for Real-Time Systems. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"26_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45470-5_21","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"K. Subramani","year":"2002","unstructured":"Subramani, K.: On identifying simple and quantified lattice points in the 2SAT polytope. In: Calmet, J., Benhamou, B., Caprotti, O., H\u00e9nocque, L., Sorge, V., et al. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol.\u00a02385, p. 217. Springer, Heidelberg (2002)"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-36137-5_14","volume-title":"SOFSEM 2002: Theory and Practice of Informatics","author":"K. Subramani","year":"2002","unstructured":"Subramani, K.: A specification framework for real-time scheduling. In: Grosky, W.I., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2002. LNCS, vol.\u00a02540, pp. 195\u2013207. Springer, Heidelberg (2002)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-45066-1_21","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"K. Subramani","year":"2003","unstructured":"Subramani, K.: An analysis of quantified linear programs. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 265\u2013277. Springer, Heidelberg (2003)"},{"key":"26_CR28","unstructured":"van Hentenryck, P.: Personal Communication"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25984-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:18:54Z","timestamp":1605759534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25984-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223450","9783540259848"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25984-8_26","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b98691","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}