A Simplicial Approach to the Determination of an Integer Point of a Simplex

Published Online:https://doi.org/10.1287/moor.23.2.403

References

  • Allgower E. L. , Georg K. Simplicial and continuation methods for approximating fixed points and solutions to systems of equations. SIAM Review (1980) 22 28 85 CrossrefGoogle Scholar
  • Dang C. The D 1-triangulation of R n for simplicial algorithms for computing solutions of nonlinear equations. Math. Oper. Res. (1991) 16 148 161 LinkGoogle Scholar
  • Dang C. , van Maaren H. A simplicial approach to integer programming—Part I. (1993a) . REPORT 93-06, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands Google Scholar
  • Dang C. , van Maaren H. A simplicial approach to integer programming—Part II. Annual Oper. Res. Soc. New Zealand (1993b) 29 131 138 Google Scholar
  • Eaves B. C. An odd theorem. Proc. Amer. Math. Soc. (1970) 26 509 513 CrossrefGoogle Scholar
  • Kojima M. , Yamamoto Y. Variable dimension algorithms: Basic theory, interpretation, and extensions of some existing methods. Math. Programming (1982) 24 177 215 CrossrefGoogle Scholar
  • Kuhn H. W. Simplicial approximation of fixed points. Proc. Nat. Acad. Sci. (1968) 61 1238 1242 CrossrefGoogle Scholar
  • Laan G. van der , Talman A. J. J. A restart algorithm for computing fixed points without an extra dimension. Math. Programming (1979) 17 74 84 CrossrefGoogle Scholar
  • Laan G. van der , Talman A. J. J. A class of simplicial restart fixed point algorithms without an extra dimension. Math. Programming (1981) 20 33 48 CrossrefGoogle Scholar
  • Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Pnueli A. A method of truncated relaxation for integer programming. (1968) . RC-2267, IBM Research, Research Division, Yorktown Heights, New York Google Scholar
  • Scarf H. E. The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. (1967) 15 1328 1343 CrossrefGoogle Scholar
  • Scarf H. E. The Computation of Economic Equilibria (1973) (Yale University Press, New Haven) Google Scholar
  • Scarf H. E. Production sets with indivisibilities—Part I: Generalities. Econometrica (1981a) 49 1 32 CrossrefGoogle Scholar
  • Scarf H. E. Production sets with indivisibilities—Part II: The case of two activities. Econometrica (1981b) 49 395 423 CrossrefGoogle Scholar
  • Schrijver A. Theory of Linear and Integer Programming (1986) (John Wiley & Sons, New York) Google Scholar
  • Todd M. J. The Computation of Fixed Points and Applications. Lecture Notes in Economics and Mathematical Systems (1976) (Springer-Verlag, Berlin) . 124 Google Scholar
  • Yamamoto Y. A new variable dimension algorithm for the fixed point problem. Math. Programming (1983) 25 329 342 CrossrefGoogle Scholar
  • Yang Z. A simplicial algorithm for testing the integral properties of polytopes: A revision. (1994) . CentER Discussion paper No. 9489, Center for Economic Research, Tilburg University, Tilburg, The Netherlands Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.