{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T06:39:51Z","timestamp":1769323191221,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1023\/a:1013847510365","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:50:27Z","timestamp":1041101427000},"page":"133-142","source":"Crossref","is-referenced-by-count":9,"title":["Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs"],"prefix":"10.1007","volume":"6","author":[{"given":"H.","family":"Van Maaren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"393731_CR1","first-page":"101","volume-title":"Progress in Combinatorial Optimization","author":"R. Chandrasekaran","year":"1982","unstructured":"R. Chandrasekaran, \u201cInteger programming problems for which a simple rounding type algorithm works,\u201d in Progress in Combinatorial Optimization,Waterloo, Ont., 1982, Academic Press: Toronto, Ont., 1984, pp. 101\u2013106."},{"issue":"1","key":"393731_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","volume":"38","author":"V. Chandru","year":"1991","unstructured":"V. Chandru and J.N. Hooker, \u201cExtended Horn sets in propositional logic,\u201d J. Assoc. Comput. Mach., vol. 38, no. 1, pp. 205\u2013221, 1991.","journal-title":"J. Assoc. Comput. Mach."},{"key":"393731_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01584992","volume":"3","author":"R.W. Cottle","year":"1972","unstructured":"R.W. Cottle and A.F. Veinott, Jr., \u201cPolyhedral sets having a least element,\u201d Math. Programming, vol. 3, pp. 238\u2013249, 1972.","journal-title":"Math. Programming"},{"key":"393731_CR4","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"C. Y. Dang","year":"1995","unstructured":"Chuang Yin Dang, Triangulations and simplicial methods, vol. 421 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag: Berlin, 1995."},{"issue":"2","key":"393731_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/moor.23.2.403","volume":"23","author":"C. Y. Dang","year":"1998","unstructured":"Chuang Yin Dang and van H. Maaren, \u201cA simplicial approach to the determination of an integer point of a simplex,\u201d Math. Oper. Res., vol. 23, no. 2, pp. 403\u2013415, 1998.","journal-title":"Math. Oper. Res."},{"key":"393731_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1008713230329","volume":"14","author":"C. Y. Dang","year":"1999","unstructured":"Chuang Yin Dang and van H. Maaren, \u201cAn abitrary starting variable dimension algorithm for computing an integer point of a simplex,\u201d Comp. Opt. And Appl., vol. 14, pp. 133\u2013155, 1999.","journal-title":"Comp. Opt. And Appl."},{"issue":"3","key":"393731_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"W.F. Dowling and J.H. Gallier, \u201cLinear-time algorithms for testing the satisfiability of propositional Horn formulae,\u201d J. Logic Programming, vol. 1, no. 3, pp. 267\u2013284, 1984.","journal-title":"J. Logic Programming"},{"key":"393731_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0121027","volume":"21","author":"B. Curtis Eaves","year":"1971","unstructured":"B. Curtis Eaves, \u201cComputing Kakutani fixed points,\u201d SIAM J. Appl. Math., vol. 21, pp. 236\u2013244, 1971.","journal-title":"SIAM J. Appl. Math."},{"key":"393731_CR9","first-page":"39","volume-title":"The Computation and Modelling of Economic Equilibria","author":"W. Forster","year":"1985","unstructured":"W. Forster, \u201cComputing all solutions of systems of polynomial equations by simplicial fixed point algorithms,\u201d in The Computation and Modelling of Economic Equilibria, Tilburg, 1985, vol. 167 of Contrib. Econom. Anal., North-Holland: Amsterdam, 1987, pp. 39\u201357."},{"key":"393731_CR10","first-page":"211","volume-title":"Satisfiability Problem: Theory and Applications","author":"J. Franco","year":"1996","unstructured":"J. Franco, \u201cRelative size of certain polynomial time solvable subclasses of satisfiability,\u201d in Satisfiability Problem: Theory and Applications, Piscataway, NJ, 1996, vol. 35 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc.: Providence, RI, 1997, pp. 211\u2013233."},{"issue":"4","key":"393731_CR11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.9.4.498","volume":"9","author":"R.M. Freund","year":"1984","unstructured":"R.M. Freund, \u201cVariable dimension complexes. II. A unified approach to some combinatorial lemmas in topology,\u201d Math. Oper. Res., vol. 9, no. 4, pp. 498\u2013509, 1984.","journal-title":"Math. Oper. Res."},{"key":"393731_CR12","first-page":"131","volume":"6","author":"F. Glover","year":"1964","unstructured":"F. Glover, \u201cA bound escalation method for the solution of integer linear programs,\u201d Cahiers Centre \u00c9tudes Recherche Op\u00e9r., vol. 6, pp. 131\u2013168, 1964.","journal-title":"Cahiers Centre \u00c9tudes Recherche Op\u00e9r."},{"issue":"6","key":"393731_CR13","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/S0097539793251876","volume":"23","author":"D.S. Hochbaum","year":"1994","unstructured":"D.S. Hochbaum and J. Naor, \u201cSimple and fast algorithms for linear and integer programs with two varibles per inequality,\u201d SIAM J. Comput., vol. 23, no. 6, pp. 1179\u20131192, 1994.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"393731_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/moor.3.1.17","volume":"3","author":"M. Kojima","year":"1978","unstructured":"M. Kojima, \u201cStudies on piecewise-linear approximations of piecewise-C\n1 mappings in fixed points and complementarity theory,\u201d Math. Oper. Res., vol. 3, no. 1, pp. 17\u201336, 1978.","journal-title":"Math. Oper. Res."},{"key":"393731_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/B978-0-12-398050-2.50007-4","volume-title":"Fixed Points: Algorithms and Applications","author":"H.W. Kuhn","year":"1977","unstructured":"H.W. Kuhn, \u201c Finding roots of polynomials by pivoting,\u201d in Fixed Points: Algorithms and Applications, Proc. First Internat. Conf., Clemson Univ., Clemson, S.C., 1974, Academic Press: New York, 1977, pp. 11\u201339."},{"issue":"1","key":"393731_CR16","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"J.C. Lagarias, \u201c The computational complexity of simultaneous Diophantine approximation problems,\u201d SIAMS J. Comput., vol. 14, no. 1, pp. 196\u2013209, 1985.","journal-title":"SIAMS J. Comput."},{"key":"393731_CR17","volume-title":"RC-2267","author":"A. Pnueli","year":"1968","unstructured":"A. Pnueli, \u201cA method of truncated relaxation for integer programming,\u201d in RC-2267,YorktownHeights: New York, 1968."},{"key":"393731_CR18","series-title":"Cowles Foundation Monograph","volume-title":"The Computatioal of Economic Equilibria","author":"H. Scarf","year":"1973","unstructured":"H. Scarf, The Computatioal of Economic Equilibria, Yale University Press: New Hasven, Conn., 1973. With the collaboration of Terja Hansen, Cowles Foundation Monograph, No. 24."},{"key":"393731_CR19","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"M.J. Todd","year":"1976","unstructured":"M.J. Todd, The Computation of Fixed Points and Applications, Lecture Notes in Economics and Mathematical Systems, vol. 124, Springer-Verlag: Berlin, 1976."},{"issue":"1","key":"393731_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01589331","volume":"20","author":"G. van der Laan","year":"1981","unstructured":"G. van der Laan and A.J.J. Talman, \u201cAclass of simplicial restart fixed point algorithms without an extra dimension,\u201d Math. Programming, vol. 20, no. 1, pp. 33\u201348, 1981.","journal-title":"Math. Programming"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013847510365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013847510365\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013847510365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:08:56Z","timestamp":1751281736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013847510365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["393731"],"URL":"https:\/\/doi.org\/10.1023\/a:1013847510365","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}