new paper on polymake in Linear and Integer Programming
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256
Dear Colleagues,
we have just finished our new paper on polymake, more precisely polymake in Linear and Integer Programming:
Our focus are convex hull computations and counting/enumeration of integer points. We have evaluated several algorithms which are available from polymake and summarized our observations in a set of rule of thumbs.
Apart from the algorithms implemented in polymake we used: - - for convex hull cdd, lrs, normaliz and ppl; - - for integer points 4ti2, latte and normaliz.
It is available in the arXiv: http://arxiv.org/abs/1408.4653
We are happy to hear your comments and feedback.
Best regards, the polymake team.
On 08/21/14 12:44, Benjamin Lorenz wrote:
Dear Colleagues,
we have just finished our new paper on polymake, more precisely polymake in Linear and Integer Programming:
Our focus are convex hull computations and counting/enumeration of integer points. We have evaluated several algorithms which are available from polymake and summarized our observations in a set of rule of thumbs.
Apart from the algorithms implemented in polymake we used:
- for convex hull cdd, lrs, normaliz and ppl;
- for integer points 4ti2, latte and normaliz.
It is available in the arXiv: http://arxiv.org/abs/1408.4653
We are happy to hear your comments and feedback.
Best regards, the polymake team.
Hi there.
Interesting paper! I think the rules of thumb are very useful. I am also happy you found that the PPL has a very good performance on the convex hull problem. We have added an entry to our bibliography, available at
http://bugseng.com/products/ppl/documentation/citations
and, in BibTeX format, at
http://bugseng.com/products/ppl/documentation/ppl_citations.bib
I guess you will publish the paper in some journal: please let us know so that we can keep the entry up to date. Kind regards,
Roberto
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
Dear Roberto,
I am glad you like that paper.
Indeed, we found that ppl's performance is very good quite often. Since polymake version 2.13 ppl can be used as one of several convex hull codes. It is very good for us to have one more efficient and reliable code at hand for this essential task.
We will keep you posted.
Best regards, Michael
On 09/28/2014 02:24 PM, Roberto Bagnara wrote:
On 08/21/14 12:44, Benjamin Lorenz wrote:
Dear Colleagues,
we have just finished our new paper on polymake, more precisely polymake in Linear and Integer Programming:
Our focus are convex hull computations and counting/enumeration of integer points. We have evaluated several algorithms which are available from polymake and summarized our observations in a set of rule of thumbs.
Apart from the algorithms implemented in polymake we used: - for convex hull cdd, lrs, normaliz and ppl; - for integer points 4ti2, latte and normaliz.
It is available in the arXiv: http://arxiv.org/abs/1408.4653
We are happy to hear your comments and feedback.
Best regards, the polymake team.
Hi there.
Interesting paper! I think the rules of thumb are very useful. I am also happy you found that the PPL has a very good performance on the convex hull problem. We have added an entry to our bibliography, available at
http://bugseng.com/products/ppl/documentation/citations
and, in BibTeX format, at
http://bugseng.com/products/ppl/documentation/ppl_citations.bib
I guess you will publish the paper in some journal: please let us know so that we can keep the entry up to date. Kind regards,
Roberto
- -- Prof. Dr. Michael Joswig joswig@math.tu-berlin.de Technische Universitaet Institut fuer Mathematik, MA 6-2 Str. des 17. Juni 136 D-10623 Berlin, Germany phone +49 (30) 314-75904 fax +49 (30) 314-25047
participants (3)
-
Benjamin Lorenz -
Michael Joswig -
Roberto Bagnara