Module: ppl/w3ppl Branch: master Commit: 00a5a04d1de046b07b157361e74fb3dcc32787a8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=00a5a04d1de...
Author: Roberto Bagnara bagnara@cs.unipr.it Date: Tue Jan 12 11:18:18 2010 +0100
Added Feautrier88.
---
htdocs/Documentation/ppl.bib | 27 +++++++++++++++++++++++++++ 1 files changed, 27 insertions(+), 0 deletions(-)
diff --git a/htdocs/Documentation/ppl.bib b/htdocs/Documentation/ppl.bib index f9ebe16..a65f5ad 100644 --- a/htdocs/Documentation/ppl.bib +++ b/htdocs/Documentation/ppl.bib @@ -1381,6 +1381,33 @@ Year = 1963 }
+@Article{Feautrier88, + Author = "P. Feautrier", + Title = "Parametric Integer Programming", + Journal = "RAIRO Recherche Op'erationnelle", + Year = 1988, + Volume = 22, + Number = 3, + Pages = "243--268", + Abstract = "When analysing computer programs (especially numerical + programs in which arrays are used extensively), one is + often confronted with integer programming problems. + These problems have three peculiarities: + feasible points are ranked according to lexicographic + order rather than the usual linear economic function; + the feasible set depends on integer parameters; + one is interested only in exact solutions. + The difficulty is somewhat alleviated by the fact that + problems sizes are usually quite small. In this paper we + show that: the classical simplex algorithm has no + difficulty in handling lexicographic ordering; the + algorithm may be executed in symbolic mode, thus giving + the solution of continuous parametric problems; the + method may be extended to problems in integers. We prove + that the resulting algorithm always terminate and give + an estimate of its complexity." +} + @Misc{Fukuda98, Author = "K. Fukuda", Title = "Polyhedral Computation {FAQ}",