A simplicial approach to the determination of an integer point of a simplex

Mathematics of Operations Research

Volumn 23, Issue 2, 1998, Pages 403-415

  Dang, Chuangyin ^a   Van Maaren, Hans ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Integer labeling; Integer point; Integer programming; Simplex; Triangulation; Variable dimension algorithm

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

INTEGER LABELING RULE; INTEGER POINT; SIMPLEX;

INTEGER PROGRAMMING;

EID: 0032073820     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.2.403     Document Type: Article

References (19)

1. Allgower, E. L., K. Georg (1980). Simplicial and continuation methods for approximating fixed points and solutions to systems of equations. SIAM Review 22 28-85.
2. n for simplicial algorithms for computing solutions of nonlinear equations. Math. Oper. Res. 16 148-161.
3. _, H. van Maaren (1993a). A simplicial approach to integer programming - Part I. REPORT 93-06, Faculty of Technical Mathematics and Informatics. Delft University of Technology, Delft, The Netherlands.
4. _, _ (1993b). A simplicial approach to integer programming - Part IL Annual Oper. Res. Soc. New Zealand 29 131-138.
5. Eaves, B. C. (1970). An odd theorem. Proc. Amer. Math. Soc. 26 509-513.
6. Kojima, M., Y. Yamamoto (1982). Variable dimension algorithms: basic theory, interpretation, and extensions of some existing methods. Math. Programming 24 177-215.
7. Kuhn, H. W. (1968). Simplicial approximation of fixed points. Proc. Nat. Acad. Sci. 61 1238-1242.
8. Laan, G. van der, A. J. J. Talman ( 1979). A restart algorithm for computing fixed points without an extra dimension. Math. Programming 17 74-84.
9. _, _ (1981). A class of simplicial restart fixed point algorithms without an extra dimension. Math. Programming 20 33-48.
10. Nemhauser, G. L., L. A. Wolsey (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York.
11. Pnueli, A. (1968). A method of truncated relaxation for integer programming. RC-2267, IBM Research, Research Division, Yorktown Heights, New York.
12. Scarf, H. E. (1967). The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15 1328-1343.
13. _ (1973). The Computation of Economic Equilibria. Yale University Press, New Haven.
14. _ (1981a). Production sets with indivisibilities - part I: Generalities. Econometrica 49 1-32.
15. _ (1981b). Production sets with indivisibilities - part II: The case of two activities. Econometrica 49 395-423.
16. Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley & Sons, New York.
17. Todd, M. J. (1976). The Computation of Fixed Points and Applications. Lecture Notes in Economics and Mathematical Systems 124, Springer-Verlag, Berlin.
18. Yamamoto, Y. (1983). A new variable dimension algorithm for the fixed point problem. Math. Programming 25 329-342.
19. Yang, Z. (1994). A simplicial algorithm for testing the integral properties of polytopes: a revision. CentER Discussion paper No. 9489, Center for Economic Research, Tilburg University, Tilburg, The Netherlands.