OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations. - Jan Telgen (Z. Oper. Research, 1979)

Randomly generated polytopes for testing mathematical programming algorithms. - W. B. van Dam; J. B. G. Frenk; Jan Telgen (Math. Program., 1983)

Hit-and-run algorithms for the identification of nonredundant linear inequalities. - H. C. P. Berbee; C. G. E. Boender; A. H. G. Rinnooy Kan; C. L. Scheffer; Robert L. Smith 002; Jan Telgen (Math. Program., 1987)

Mathematical programming study 31 - Computational Mathematical Programming. - Karla L. Hoffman; Richard H. F. Jackson; Jan Telgen (Math. Program., 1988)

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. - C. G. E. Boender; Richard J. Caron; J. Fred McDonald; A. H. G. Rinnooy Kan; H. Edwin Romeijn; Robert L. Smith 002; Jan Telgen; A. C. F. Vorst (Oper. Res., 1991)

A basis for modelling the costs of supplier selection: the economic tender quantity. - Luitzen de Boer; Gerhard C. van Dijkhuizen; Jan Telgen (J. Oper. Res. Soc., 2000)

Unfair allocation of gains under the Equal Price allocation method in purchasing groups. - Fredo Schotanus; Jan Telgen; Luitzen de Boer (Eur. J. Oper. Res., 2008)