PipLib

PIP/Piplib, a parametric integer linear programming solver. PIP/PipLib is the well known Paul Feautrier’s parametric integer linear programming solver. PIP is a software that finds the lexicographic minimum (or maximum) in the set of integer points belonging to a convex polyhedron. The very big difference with well known integer programming tools like lp_solve or CPLEX is the polyhedron may depend linearly on one or more integral parameters. If the user asks for a non integral solution, PIP can give the exact solution as an integral quotient. The heart of PIP is the parametrized Gomory’s cuts algorithm followed by the parameterized dual simplex method. The PIP Library (PipLib for short) was implemented to allow the user to call PIP directly from his programs, without file accesses or system calls. The user only needs to link his programs with C libraries.


References in zbMATH (referenced in 19 articles , 1 standard article )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Fu, Norie; Shibuta, Takafumi: An algebraic algorithm for solving parametric integer programs (2018)
  2. Hatam, Mahdi; Masnadi-Shirazi, Mohammad Ali: A novel analytical integer optimization method for wavelet based subband coding (2016)
  3. Fu, Norie; Shibuta, Takafumi: An algorithm for solving parametric integer program (2015)
  4. Klebanov, Vladimir: Precise quantitative information flow analysis -- a symbolic approach (2014)
  5. Beletska, Anna; Bielecki, Wlodzimierz; Cohen, Albert; Palkowski, Marek; Siedlecki, Krzysztof: Coarse-grained loop parallelization: iteration space slicing vs affine transformations (2011) ioport
  6. Bagnara, Roberto; Hill, Patricia M.; Zaffanella, Enea: Exact join detection for convex polyhedra and other numerical abstractions (2010)
  7. Steinberg, R. B.: Mapping loop nests to multipipelined architecture (2010)
  8. Ballabriga, Clément; Cassé, Hugues; De Michiel, Marianne: A generic framework for blackbox components in WCET computation (2009) ioport
  9. Bygde, Stefan; Lisper, Björn: Towards an automatic parametric WCET analysis (2008) ioport
  10. Xue, Jingling; Guo, Minyi; Wei, Daming: Improving the parallelism of iterative methods by aggressive loop fusion (2008) ioport
  11. Brisebarre, Nicolas; Muller, Jean-Michel; Tisserand, Arnaud: Computing machine-efficient polynomial approximations. (2006)
  12. Größlinger, Armin; Griebl, Martin; Lengauer, Christian: Quantifier elimination in automatic loop parallelization (2006)
  13. Cosnard, M.; Loi, M.: A simple algorithm for the generation of efficient loop structures. (1996) ioport
  14. Thiele, Lothar: Resource constrained scheduling of uniform algorithms. (1995) ioport
  15. Xue, Jingling: Closed-form mapping conditions for the synthesis of linear processor arrays. (1995) ioport
  16. Feautrier, Paul: Some efficient solutions to the affine scheduling problem. II: Multidimensional time (1992)
  17. Feautrier, Paul: Some efficient solutions to the affine scheduling problem. I: One- dimensional time (1992)
  18. Feautrier, Paul: Dataflow analysis of array and scalar references (1991)
  19. Feautrier, Paul: Parametric integer programming (1988)