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

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

1 2 3 4 5 6 next

  1. Abramsky, Samson: Classical logic, classical probability, and quantum mechanics (2020)
  2. Heck, Daniel W.; Davis-Stober, Clintin P.: Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (2019)
  3. Hildenbrandt, Achim: A branch-and-cut algorithm for the target visitation problem (2019)
  4. Kim, Jinhak; Tawarmalani, Mohit; Richard, Jean-Philippe P.: On cutting planes for cardinality-constrained linear programs (2019)
  5. Walteros, Jose L.; Veremyev, Alexander; Pardalos, Panos M.; Pasiliao, Eduardo L.: Detecting critical node structures on graphs: a mathematical programming approach (2019)
  6. Arslan, Okan; Jabali, Ola; Laporte, Gilbert: Exact solution of the evasive flow capturing problem (2018)
  7. Ben-Ameur, Walid; Glorieux, Antoine; Neto, José: Complete formulations of polytopes related to extensions of assignment matrices (2018)
  8. Davis-Stober, Clintin P.; Doignon, Jean-Paul; Fiorini, Samuel; Glineur, François; Regenwetter, Michel: Extended formulations for order polytopes through network flows (2018)
  9. Deza, Michel; Dutour Sikirić, Mathieu: The hypermetric cone and polytope on eight vertices and some generalizations (2018)
  10. Doostmohammadi, Mahdi; Akartunalı, Kerem: Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (2018)
  11. Fairbrother, Jamie; Letchford, Adam N.; Briggs, Keith: A two-level graph partitioning problem arising in mobile wireless communications (2018)
  12. Gläßle, T.; Gross, D.; Chaves, R.: Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (2018)
  13. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  14. Aguilera, Néstor E.; Katz, Ricardo D.; Tolomei, Paola B.: Vertex adjacencies in the set covering polyhedron (2017)
  15. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with \textttpolymake (2017)
  16. Moeini, Asghar: Identification of unidentified equality constraints for integer programming problems (2017)
  17. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo; Santos, Haroldo: Limited memory rank-1 cuts for vehicle routing problems (2017)
  18. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  19. Agra, Agostinho; Doostmohammadi, Mahdi; de Souza, Cid C.: Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (2016)
  20. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)

1 2 3 4 5 6 next