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 104 articles , 1 standard article )

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

1 2 3 4 5 6 next

  1. Ben-Ameur, Walid; Glorieux, Antoine; Neto, José: Complete formulations of polytopes related to extensions of assignment matrices (2018)
  2. Deza, Michel; Dutour Sikirić, Mathieu: The hypermetric cone and polytope on eight vertices and some generalizations (2018)
  3. Doostmohammadi, Mahdi; Akartunalı, Kerem: Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (2018)
  4. Fairbrother, Jamie; Letchford, Adam N.; Briggs, Keith: A two-level graph partitioning problem arising in mobile wireless communications (2018)
  5. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  6. Aguilera, Néstor E.; Katz, Ricardo D.; Tolomei, Paola B.: Vertex adjacencies in the set covering polyhedron (2017)
  7. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  8. Moeini, Asghar: Identification of unidentified equality constraints for integer programming problems (2017)
  9. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  10. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)
  11. Davis-Stober, Clintin P.; Morey, Richard D.; Gretton, Matthew; Heathcote, Andrew: Bayes factors for state-trace analysis (2016)
  12. Doignon, Jean-Paul; Rexhep, Selim: Primary facets of order polytopes (2016)
  13. Galluccio, Anna; Gentile, Claudio: The stable set polytope of icosahedral graphs (2016)
  14. Gupte, Akshay: Convex hulls of superincreasing knapsacks and lexicographic orderings (2016)
  15. Köppe, Matthias; Zhou, Yuan: Toward computer-assisted discovery and automated proofs of cutting plane theorems (2016)
  16. Buchheim, Christoph; Traversi, Emiliano: On the separation of split inequalities for non-convex quadratic integer programming (2015)
  17. Davis-Stober, Clintin P.; Brown, Nicholas; Cavagnaro, Daniel R.: Individual differences in the algebraic structure of preferences (2015)
  18. 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)
  19. Fomeni, Franklin Djeumou; Kaparis, Konstantinos; Letchford, Adam N.: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (2015)
  20. Lörwald, Stefan; Reinelt, Gerhard: PANDA: a software for polyhedral transformations (2015)

1 2 3 4 5 6 next