[PPL-devel] [GIT] ppl/ppl(master): Added AssarfGHJLPR14TR.

[Roberto Bagnara]

Module: ppl/ppl
Branch: master
Commit: 15e33202bf9ec5eac164caec46aaa3f04e3b749e
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=15e33202bf9ec5eac164caec46aaa3f04e3b749e

Author: Roberto Bagnara <roberto.bagnara at bugseng.com>
Date:   Sun Sep 28 13:57:20 2014 +0200

Added AssarfGHJLPR14TR.

---

 doc/ppl_citations.bib |   32 ++++++++++++++++++++++++++++++++
 1 files changed, 32 insertions(+), 0 deletions(-)

diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib
index 528af06..48aa0f0 100644
--- a/doc/ppl_citations.bib
+++ b/doc/ppl_citations.bib
@@ -729,6 +729,38 @@ Summarizing:
               analysis of systems previously beyond reach."
 }
 
+ at Techreport{AssarfGHJLPR14TR,
+  Author = "B. Assarf and E. Gawrilow and K. Herr and M. Joswig
+            and B. Lorenz and A. Paffenholz and T. Rehn",
+  Title = "{polymake} in Linear and Integer Programming",
+  Number = "arXiv:1408.4653 [math.CO]",
+  Note = "Available from \url{http://arxiv.org/}",
+  Year = 2014,
+  Month = aug,
+  URL = "http://arxiv.org/abs/1408.4653",
+  Abstract = "In integer and linear optimization the software
+              workhorses are solvers for linear programs as well as
+              generic frameworks for branch-and-bound or
+              branch-and-cut schemes. While today it is common to
+              solve linear programs with millions of rows and columns
+              and, moreover, mixed integer linear programs with
+              sometimes hundreds of thousands of rows and columns, big
+              challenges remain. A main purpose of this note is to
+              report on the state of the art of getting at the facets
+              of the integer hull in a brute force kind of way. And we
+              will do so by explaining how our software system
+              polymake can help. First, we explore how various convex
+              hull algorithms and implementations behave on various
+              kinds of input. Our input is chosen according to typical
+              scenarios which are motivated by computational tasks
+              arising in optimization. Second, we look into
+              enumerating lattice points in polytopes, which is
+              actually the first step for this integer hull
+              approach. We will sum up our experience in this area in
+              several ``rules of thumb'', all of which have to be taken
+              with a grain of salt."
+}
+
 @Inproceedings{Avery06,
   Author = "J. Avery",
   Title = "Size-Change Termination and Bound Analysis",