|
C.6.2.1 The algorithm of Conti and TraversoThe algorithm of Conti and Traverso (see [CoTr91]) Because of the big number of auxiliary variables needed to compute a toric ideal, this algorithm is rather slow in practice. However, it has a special importance in the application to integer programming (see Integer programming).
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |