Asset Details
Do you wish to reserve the book?
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex
Do you wish to request the book?
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex
1999
Overview
An arbitrary starting variable dimension algorithm is proposed to compute an integer point of an n-dimensional simplex. It is based on an integer labeling rule and a triangulation of R^n. The algorithm consists of two interchanging phases. The first phase of the algorithm is a variable dimension algorithm, which generates simplices of varying dimensions, and the second phase of the algorithm forms a full-dimensional pivoting procedure, which generates n-dimensional simplices. The algorithm varies from one phase to the other. When the matrix defining the simplex is in the so-called canonical form, starting at an arbitrary integer point, the algorithm within a finite number of iterations either yields an integer point of the simplex or proves that no such point exists. [PUBLICATION ABSTRACT]
Publisher
Springer Nature B.V
Subject
