{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002403,"version":"3.41.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1008713230329","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"133-155","source":"Crossref","is-referenced-by-count":8,"title":["An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex"],"prefix":"10.1007","volume":"14","author":[{"given":"Chuangyin","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Van","family":"Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"203791_CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/1022003","volume":"22","author":"E.L. Allgower","year":"1980","unstructured":"E.L. Allgower and K. Georg, \u201cSimplicial and continuation methods for approximating fixed points and solutions to systems of equations,\u201d SIAM Review, vol. 22, pp. 28\u201385, 1980.","journal-title":"SIAM Review"},{"key":"203791_CR2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/moor.16.1.148","volume":"16","author":"C. Dang","year":"1991","unstructured":"C. Dang, \u201cThe D\n1-triangulation of R\n\n                    n\n                   for simplicial algorithms for computing solutions of nonlinear equations,\u201d Mathematics of Operations Research, vol. 16, pp. 148\u2013161, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"203791_CR3","unstructured":"C. Dang and H. van Maaren, \u201cA simplicial approach to integer programming\u2014Part I,\u201d Report 93\u201306, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands."},{"key":"203791_CR4","first-page":"131","volume":"29","author":"C. Dang","year":"1993","unstructured":"C. Dang and H. van Maaren, \u201cA simplicial approach to integer programming\u2014Part II,\u201d Annual of the Operational Research Society of New Zealand, vol. 29, pp. 131\u2013138, 1993.","journal-title":"Annual of the Operational Research Society of New Zealand"},{"key":"203791_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/moor.23.2.403","volume":"23","author":"C. Dang","year":"1998","unstructured":"C. Dang and H. van Maaren, \u201cA simplicial approach to the determination of an integral point of a simplex,\u201d Mathematics of Operations Research, vol. 23, pp. 403\u2013415, 1998.","journal-title":"Mathematics of Operations Research"},{"key":"203791_CR6","unstructured":"C. Dang and H. van Maaren, \u201cComputing an integer point of a simplex with an arbitrary starting simplicial algorithm,\u201d Report 96\u201312, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands."},{"key":"203791_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584975","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"B.C. Eaves, \u201cHomotopies for the computation of fixed points,\u201d Mathematical Programming, vol. 3, pp. 1\u201322, 1972.","journal-title":"Mathematical Programming"},{"key":"203791_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01584991","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"B.C. Eaves and R. Saigal, \u201cHomotopies for the computation of fixed points on unbounded regions,\u201d Mathematical Programming, vol. 3, pp. 225\u2013237, 1972.","journal-title":"Mathematical Programming"},{"key":"203791_CR9","doi-asserted-by":"crossref","first-page":"580","DOI":"10.2307\/1968813","volume":"43","author":"H. Freudenthal","year":"1942","unstructured":"H. Freudenthal, \u201cSimplizialzerlegungen von Beschrankter Flachheit,\u201d Annals of Mathematics, vol. 43, pp. 580\u2013582, 1942.","journal-title":"Annals of Mathematics"},{"key":"203791_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01585103","volume":"24","author":"M. Kojima","year":"1982","unstructured":"M. Kojima and Y. Yamamoto, \u201cVariable dimension algorithms: Basic theory, interpretation, and extensions of some existing methods,\u201d Mathematical Programming, vol. 24, pp. 177\u2013215, 1982.","journal-title":"Mathematical Programming"},{"key":"203791_CR11","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1073\/pnas.61.4.1238","volume":"61","author":"H.W. Kuhn","year":"1968","unstructured":"H.W. Kuhn, \u201cSimplicial approximation of fixed points,\u201d in Proceedings of National Academy of Science, 1968, vol. 61, pp. 1238\u20131242.","journal-title":"Proceedings of National Academy of Science"},{"key":"203791_CR12","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01588226","volume":"17","author":"G. van der Laan","year":"1979","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA restart algorithm for computing fixed points without an extra dimension,\u201d Mathematical Programming, vol. 17, pp. 74\u201384, 1979.","journal-title":"Mathematical Programming"},{"key":"203791_CR13","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, \u201cA class of simplicial restart fixed point algorithms without an extra dimension,\u201d Mathematical Programming, vol. 20, pp. 33\u201348, 1981.","journal-title":"Mathematical Programming"},{"key":"203791_CR14","unstructured":"O.H. Merrill, \u201cApplications and extensions of an algorithm that computes fixed points of certain upper semicontinuous point to set mappings,\u201d Ph.D. Thesis, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI."},{"key":"203791_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons: New York, 1988."},{"key":"203791_CR16","series-title":"IBM Research","volume-title":"A method of truncated relaxation for integer programming","author":"A. Pnueli","year":"1968","unstructured":"A. Pnueli, \u201cA method of truncated relaxation for integer programming,\u201d RC 2267, IBM Research, Research Division, Yorktown Heights, New York, 1968."},{"key":"203791_CR17","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H.E. Scarf","year":"1967","unstructured":"H.E. Scarf, \u201cThe approximation of fixed points of a continuous mapping,\u201d SIAM Journal on Applied Mathematics, vol. 15, pp. 1328\u20131343, 1967.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"203791_CR18","volume-title":"The Computation of Economic Equilibria","author":"H.E. Scarf","year":"1973","unstructured":"H.E. Scarf (collaboration with T. Hansen), The Computation of Economic Equilibria, Yale University Press: New Haven, 1973."},{"key":"203791_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"H.E. Scarf","year":"1981","unstructured":"H.E. Scarf, \u201cProduction sets with indivisibilities\u2014part I: Generalities,\u201d Econometrica, vol. 49, pp. 1\u201332, 1981.","journal-title":"Econometrica"},{"key":"203791_CR20","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/1913318","volume":"49","author":"H.E. Scarf","year":"1981","unstructured":"H.E. Scarf, \u201cProduction sets with indivisibilities\u2014part II: The case of two activities,\u201d Econometrica, vol. 49, pp. 395\u2013423, 1981.","journal-title":"Econometrica"},{"key":"203791_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, 1986."},{"key":"203791_CR22","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50327-6","volume-title":"The Computation of Fixed Points and Applications","author":"M.J. Todd","year":"1976","unstructured":"M.J. Todd, \u201cThe Computation of Fixed Points and Applications,\u201d Lecture Notes in Economics and Mathematical Systems 124, Springer-Verlag: Berlin, 1976."},{"key":"203791_CR23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02594783","volume":"25","author":"Y. Yamamoto","year":"1983","unstructured":"Y. Yamamoto, \u201cA new variable dimension algorithm for the fixed point problem,\u201d Mathematical Programming, vol. 25, pp. 329\u2013342, 1983.","journal-title":"Mathematical Programming"},{"key":"203791_CR24","series-title":"CentER Discussion paper","volume-title":"A simplicial algorithm for testing the integral properties of polytopes: A revision","author":"Z. Yang","year":"1994","unstructured":"Z. Yang, \u201cA simplicial algorithm for testing the integral properties of polytopes: A revision,\u201d CentER Discussion paper No. 9489, Center for Economic Research, Tilburg University, Tilburg, The Netherlands, 1994."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008713230329.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008713230329\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008713230329.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:08:48Z","timestamp":1752376128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008713230329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["203791"],"URL":"https:\/\/doi.org\/10.1023\/a:1008713230329","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}