{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:34:04Z","timestamp":1742988844986,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":21,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_616","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:08:03Z","timestamp":1219662483000},"page":"3585-3591","source":"Crossref","is-referenced-by-count":0,"title":["Simplicial Pivoting Algorithms for Integer Programming"],"prefix":"10.1007","author":[{"given":"Hans van","family":"Maaren","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"616_CR1_616","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/B978-0-12-566780-7.50011-8","volume-title":"Progress in Combinatorial Optimization (Waterloo, Ont., 1982)","author":"R. Chandrasekaran","year":"1984","unstructured":"Chandrasekaran R (1984) Integer programming problems for which a\u00a0simple rounding type algorithm works. In: Progress in Combinatorial Optimization (Waterloo, Ont., 1982). Acad. Press, New York, pp 101\u2013106"},{"issue":"1","key":"616_CR2_616","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/102782.102789","volume":"38","author":"V. Chandru","year":"1991","unstructured":"Chandru V, Hooker JN (1991) Extended Horn sets in propositional logic. J\u00a0ACM 38(1):205\u2013221","journal-title":"J. ACM"},{"key":"616_CR3_616","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01584992","volume":"3","author":"R.W. Cottle","year":"1972","unstructured":"Cottle RW, Veinott AF Jr (1972) Polyhedral sets having a\u00a0least element. Math Program 3:238\u2013249","journal-title":"Math. Program."},{"key":"616_CR4_616","series-title":"Lecture Notes Economics and Math. Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48775-0","volume-title":"Triangulations and simplicial methods","author":"ChuangYin Dang","year":"1995","unstructured":"Dang Chuang Yin (1995) Triangulations and simplicial methods. Lecture Notes Economics and Math Systems, vol\u00a0421. Springer, Berlin"},{"issue":"2","key":"616_CR5_616","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/moor.23.2.403","volume":"23","author":"ChuangYin Dang","year":"1998","unstructured":"Dang Chuang Yin, Maaren H van (1998) A\u00a0simplicial approach to the determination of an integral point of a\u00a0simplex. Math Oper Res 23(2):403\u2013415","journal-title":"Math. Oper. Res."},{"issue":"1","key":"616_CR6_616","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1008713230329","volume":"14","author":"ChuangYin Dang","year":"1999","unstructured":"Dang Chuang Yin, Maaren H van (1999) An arbitrary starting variable dimension algorithm for computing an integer point of a\u00a0simplex. Comput Optim Appl 14(1):133\u2013155","journal-title":"Comput. Optim. Appl."},{"key":"616_CR7_616","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0121027","volume":"21","author":"C.B. Eaves","year":"1971","unstructured":"Eaves CB (1971) Computing Kakutani fixed points. SIAM J Appl Math 21:236\u2013244","journal-title":"SIAM J. Appl. Math."},{"key":"616_CR8_616","series-title":"Contrib. Econom. Anal.","first-page":"39","volume-title":"The Computation And Modelling Of Economic Equilibria (Tilburg, 1985)","author":"W. Forster","year":"1987","unstructured":"Forster W (1987) Computing \u201call\u201d solutions of systems of polynomial equations by simplicial fixed point algorithms: The Computation And Modelling Of Economic Equilibria (Tilburg, 1985). In: Contrib Econom Anal, vol\u00a0167. North-Holland, Amsterdam, pp 39\u201357"},{"key":"616_CR9_616","series-title":"DIMACS 35","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1090\/dimacs\/035\/04","volume-title":"Satisfiability problem: theory and applications (Piscataway, NJ, 1996)","author":"J. Franco","year":"1997","unstructured":"Franco J (1997) Relative size of certain polynomial time solvable subclasses of satisfiability. In: Satisfiability problem: theory and applications (Piscataway, NJ, 1996). In: DIMACS 35. Amer. Math. Soc., Providence, RI, pp 211\u2013223"},{"issue":"4","key":"616_CR10_616","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/moor.9.4.498","volume":"9","author":"R.M. Freund","year":"1984","unstructured":"Freund RM (1984) Variable dimension complexes. II. A\u00a0unified approach to some combinatorial lemmas in topology. Math Oper Res 9(4):498\u2013509","journal-title":"Math. Oper. Res."},{"key":"616_CR11_616","first-page":"131","volume":"6","author":"F. Glover","year":"1964","unstructured":"Glover F (1964) A\u00a0bound escalation method for the solution of integer linear programs. Cahiers CERO 6:131\u2013168","journal-title":"Cahiers CERO"},{"issue":"6","key":"616_CR12_616","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1137\/S0097539793251876","volume":"23","author":"D.S. Hochbaum","year":"1994","unstructured":"Hochbaum DS, Naor J (1994) Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM J Comput 23(6):1179\u20131192","journal-title":"SIAM J. Comput."},{"key":"616_CR13_616","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/B978-0-12-398050-2.50007-4","volume-title":"Fixed Points: Algorithms And Applications (Proc. First Internat. Conf., Clemson Univ., Clemson, S.C., 1974)","author":"H.W. Kuhn","year":"1977","unstructured":"Kuhn HW (1977) Finding roots of polynomials by pivoting. In: Fixed Points: Algorithms And Applications (Proc. First Internat. Conf., Clemson Univ., Clemson, S.C., 1974). Acad. Press, New York, pp 11\u201339"},{"issue":"1","key":"616_CR14_616","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias JC (1985) The computational complexity of simultaneous Diophantine approximation problems. SIAM J Comput 14(1):196\u2013209","journal-title":"SIAM J. Comput."},{"key":"616_CR15_616","unstructured":"Maaren H van (1998) A\u00a0simplicial algorithm for a\u00a0tractable class of integer programs. Techn. Report Delft Univ. Technol. 98-33"},{"issue":"1","key":"616_CR16_616","doi-asserted-by":"publisher","first-page":"134","DOI":"10.2307\/2042898","volume":"73","author":"M.D. Meyerson","year":"1979","unstructured":"Meyerson MD, Wright AH (1979) A\u00a0new and constructive proof of the Borsuk\u2013Ulam theorem. Proc Amer Math Soc 73(1):134\u2013136","journal-title":"Proc. Amer. Math. soc."},{"key":"616_CR17_616","unstructured":"Pnueli A (1968) A\u00a0method of truncated relaxation for integer programming. IBM Res. Paper"},{"key":"616_CR18_616","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H.E. Scarf","year":"1967","unstructured":"Scarf HE (1967) The approximation of fixed points of a\u00a0continuous mapping. SIAM J Appl Math 15:1328\u20131343","journal-title":"SIAM J. Appl. Math."},{"key":"616_CR19_616","doi-asserted-by":"publisher","first-page":"50","DOI":"10.2307\/1909383","volume":"35","author":"H.E. Scarf","year":"1967","unstructured":"Scarf HE (1967) The core of an N person game. Econometrica 35:50\u201369","journal-title":"Econometrica"},{"key":"616_CR20_616","series-title":"Cowles Foundation Monograph","volume-title":"The computation of economic equilibria","author":"H.E. Scarf","year":"1973","unstructured":"Scarf HE (1973) The computation of economic equilibria. Cowles Foundation Monograph, vol\u00a024. Yale Univ. Press, New Haven, CT, With the collaboration of Terje Hansen."},{"issue":"3","key":"616_CR21_616","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(95)00019-9","volume":"54","author":"J.S. Schlipf","year":"1995","unstructured":"Schlipf JS, Annexstein FS, Franco JV, Swaminathan RP (1995) On finding solutions for extended Horn formulas. Inform Process Lett 54(3):133\u2013137","journal-title":"Inform. Process. Lett."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:40:11Z","timestamp":1720694411000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_616","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}