PORTA is a collection of routines for analyzing polytopes and polyhedra. The polyhedra are either given as the convex hull of a set of points plus (possibly) the convex cone of a set of vectors, or as a system of linear equations and inequalities. The name PORTA is an abbreviation for POlyhedron Representation Transformation Algorithm and points to the basic function ’traf’. This function performs a transformation from one of the two representations to the other representation. For this, ’traf’ uses a Fourier - Motzkin elimination algorithm which projects a linear system on subspaces xi = 0. This projection of a given system of linear inequalities can be done separately by using the function ’fmel’. ...

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

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

1 2 3 4 5 next

  1. Aguilera, Néstor E.; Katz, Ricardo D.; Tolomei, Paola B.: Vertex adjacencies in the set covering polyhedron (2017)
  2. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  3. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  4. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)
  5. Davis-Stober, Clintin P.; Morey, Richard D.; Gretton, Matthew; Heathcote, Andrew: Bayes factors for state-trace analysis (2016)
  6. Doignon, Jean-Paul; Rexhep, Selim: Primary facets of order polytopes (2016)
  7. Galluccio, Anna; Gentile, Claudio: The stable set polytope of icosahedral graphs (2016)
  8. Gupte, Akshay: Convex hulls of superincreasing knapsacks and lexicographic orderings (2016)
  9. Köppe, Matthias; Zhou, Yuan: Toward computer-assisted discovery and automated proofs of cutting plane theorems (2016)
  10. Buchheim, Christoph; Traversi, Emiliano: On the separation of split inequalities for non-convex quadratic integer programming (2015)
  11. Davis-Stober, Clintin P.; Brown, Nicholas; Cavagnaro, Daniel R.: Individual differences in the algebraic structure of preferences (2015)
  12. Escalante, Mariana; Marenco, Javier; del Carmen Varaldo, María: The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (2015)
  13. Fomeni, Franklin Djeumou; Kaparis, Konstantinos; Letchford, Adam N.: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (2015)
  14. Lörwald, Stefan; Reinelt, Gerhard: PANDA: a software for polyhedral transformations (2015)
  15. Agra, Agostinho; Doostmohammadi, Mahdi: Facets for the single node fixed-charge network set with a node set-up variable (2014)
  16. Bektaş, Tolga; Gouveia, Luis: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (2014)
  17. Chung, Kwanghun; Richard, Jean-Philippe P.; Tawarmalani, Mohit: Lifted inequalities for $0-1$ mixed-integer bilinear covering sets (2014)
  18. Galluccio, A.; Gentile, C.; Ventura, P.: The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are $\mathcalG$-perfect (2014)
  19. Hosono, Shinobu; Takagi, Hiromichi: Mirror symmetry and projective geometry of Reye congruences. I (2014)
  20. Neto, José: On the polyhedral structure of uniform cut polytopes (2014)

1 2 3 4 5 next