SMAPO is a library of linear descriptions of low-dimensional 0/1-polytopes connected with small instances of combinatorial optimization problems.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
- Galli, Laura; Letchford, Adam N.: Small bipartite subgraph polytopes (2010)
- Reinelt, Gerhard; Theis, Dirk Oliver; Wenger, Klaus Michael: Computing finest mincut partitions of a graph and application to routing problems (2008)
- Oswald, Marcus; Reinelt, Gerhard; Theis, Dirk Oliver: On the graphical relaxation of the symmetric traveling salesman polytope (2007)