van der Laan,G.Talman,A.J.J.Yang,Z.F.2025-01-312025-01-312004van der Laan, G, Talman, A J J & Yang, Z F 2004 'Solving discrete zero point problems' CentER Discussion Paper, vol. 2004-113, Operations research, Tilburg.arno: 145877metis: 251560https://hdl.handle.net/20.500.14602/27249Pagination: 15In this paper an algorithm is proposed to .nd a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space IRn.Starting with a given integral point, the algorithm generates a .nite sequence of adjacent integral simplices of varying dimension and terminates with, under certain convergency conditions, a vertex, which yields a discrete zero point of the function under consideration.enginfo:eu-repo/semantics/restrictedAccessdiscrete zero pointdiscrete fixed pointsimplicial algorithmtriangulationDiscussion paperGeneral rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. - Users may download and print one copy of any publication from the public portal for the purpose of private study or research. - You may not further distribute the material or use it for any profit-making activity or commercial gain - You may freely distribute the URL identifying the publication in the public portal" Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.62965415https://research.tilburguniversity.edu/en/publications/7199ad17-969b-4bd5-b82a-fa7a98361fb7(c) Universiteit van Tilburgvan der Laan, G.Talman, A.J.J.Yang, Z.F.