A Simplicial Approach to the Determination of an Integer Point of a Simplex
暂无分享,去创建一个
[1] Yoshitsugu Yamamoto,et al. A new variable dimension algorithm for the fixed point problem , 1983, Math. Program..
[2] Herbert E. Scarf,et al. The Approximation of Fixed Points of a Continuous Mapping , 1967 .
[3] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[4] Gerard van der Laan,et al. A class of simplicial restart fixed point algorithms without an extra dimension , 1981, Math. Program..
[5] Chuangyin Dang. The D1-triangulation in simplicial algorithms , 1991 .
[6] H. Kuhn. Simplicial approximation of fixed points. , 1968, Proceedings of the National Academy of Sciences of the United States of America.
[7] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[8] Chuangyin Dang. The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations , 1991, Math. Oper. Res..
[9] B. Eaves. An odd theorem , 1970 .
[10] Masakazu Kojima,et al. Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods , 1982, Math. Program..
[11] Gerard van der Laan,et al. A restart algorithm for computing fixed points without an extra dimension , 1979, Math. Program..
[12] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[13] Z. F. Yang. A simplicial algorithm for testing the integral properties of polytopes : A revision , 1994 .
[14] E. Allgower,et al. Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .
[15] M. Todd. The Computation of Fixed Points and Applications , 1976 .