Arbitrary starting variable dimension algorithm for computing an integer point of a simplex

Computational Optimization and Applications

Volumn 14, Issue 1, 1999, Pages 133-155

  Dang, Chuangyin ^a   Van Maaren, Hans ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; ITERATIVE METHODS; PROBLEM SOLVING; TRIANGULATION;

INTEGER LABELING RULE; INTEGER POINT; VARIABLE DIMENSION ALGORITHM;

COMPUTATIONAL METHODS;

EID: 0032626188     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008713230329     Document Type: Article

References (24)

1. E.L. Allgower and K. Georg, "Simplicial and continuation methods for approximating fixed points and solutions to systems of equations," SIAM Review, vol. 22, pp. 28-85, 1980.
2. n for simplicial algorithms for computing solutions of nonlinear equations," Mathematics of Operations Research, vol. 16, pp. 148-161, 1991.
3. C. Dang and H. van Maaren, "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. C. Dang and H. van Maaren, "A simplicial approach to integer programming - Part II," Annual of the Operational Research Society of New Zealand, vol. 29, pp. 131-138, 1993.
5. C. Dang and H. van Maaren, "A simplicial approach to the determination of an integral point of a simplex," Mathematics of Operations Research, vol. 23, pp. 403-415, 1998.
6. C. Dang and H. van Maaren, "Computing an integer point of a simplex with an arbitrary starting simplicial algorithm," Report 96-12, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands.
7. B.C. Eaves, "Homotopies for the computation of fixed points," Mathematical Programming, vol. 3, pp. 1-22, 1972.
8. B.C. Eaves and R. Saigal, "Homotopies for the computation of fixed points on unbounded regions," Mathematical Programming, vol. 3, pp. 225-237, 1972.
9. H. Freudenthal, "Simplizialzerlegungen von Beschrankter Flachheit," Annals of Mathematics, vol. 43, pp. 580-582, 1942.
10. M. Kojima and Y. Yamamoto, "Variable dimension algorithms: Basic theory, interpretation, and extensions of some existing methods," Mathematical Programming, vol. 24, pp. 177-215, 1982.
11. H.W. Kuhn, "Simplicial approximation of fixed points," in Proceedings of National Academy of Science, 1968, vol. 61, pp. 1238-1242.
12. G. van der Laan and A.J.J. Talman, "A restart algorithm for computing fixed points without an extra dimension," Mathematical Programming, vol. 17, pp. 74-84, 1979.
13. G. van der Laan and A.J.J. Talman, "A class of simplicial restart fixed point algorithms without an extra dimension," Mathematical Programming, vol. 20, pp. 33-48, 1981.
14. O.H. Merrill, "Applications and extensions of an algorithm that computes fixed points of certain upper semicontinuous point to set mappings," Ph.D. Thesis, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
15. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons: New York, 1988.
16. A. Pnueli, "A method of truncated relaxation for integer programming," RC 2267, IBM Research, Research Division, Yorktown Heights, New York, 1968.
17. H.E. Scarf, "The approximation of fixed points of a continuous mapping," SIAM Journal on Applied Mathematics, vol. 15, pp. 1328-1343, 1967.
18. H.E. Scarf (collaboration with T. Hansen), The Computation of Economic Equilibria, Yale University Press: New Haven, 1973.
19. H.E. Scarf, "Production sets with indivisibilities - part I: Generalities," Econometrica, vol. 49, pp. 1-32, 1981.
20. H.E. Scarf, "Production sets with indivisibilities - part II: The case of two activities," Econometrica, vol. 49, pp. 395-423, 1981.
21. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, 1986.
22. M.J. Todd, "The Computation of Fixed Points and Applications," Lecture Notes in Economics and Mathematical Systems 124, Springer-Verlag: Berlin, 1976.
23. Y. Yamamoto, "A new variable dimension algorithm for the fixed point problem," Mathematical Programming, vol. 25, pp. 329-342, 1983.
24. Z. Yang, "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, 1994.