Showing 1 - 8 of 8
This discussion paper led to a publication in <A href="http://www.sciencedirect.com/science/article/pii/S0377221711004498">'European Journal of Operational Research'</A>, 214(3), 493-500.<P>We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is...</p></a>
Persistent link: https://www.econbiz.de/10011256220
This discussion paper resulted in a publication in the 'SIAM Journal on Optimization', 2007, 18, 290-308. <P> In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under...</p>
Persistent link: https://www.econbiz.de/10011256600
This discussion paper resulted in a publication in 'Mathematical Programming', ser. A, 2006, 108, 127-134. <P>
Persistent link: https://www.econbiz.de/10011256768
This discussion paper resulted in a publication in the 'Journal of Optimization Theory and Applications', 2010, 144, 391-407. <p> Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to...</p>
Persistent link: https://www.econbiz.de/10011257467
We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...
Persistent link: https://www.econbiz.de/10004964458
In this paper we present two general results on the existence of a discrete zero point of a function from the <I>n</I>-dimensional integer lattice Z<SUP><I>n</SUP></I> to the <I>n</I>-dimensional Euclidean space R<SUP><I>n</SUP></I>. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...</i></sup></i></i></sup></i>
Persistent link: https://www.econbiz.de/10005137126
<I>Abstract</I><p> See document.<p>
Persistent link: https://www.econbiz.de/10005209454
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10005144416