Pages that link to "Item:Q1814809"

The following pages link to Combinatorial optimization and small polytopes (Q1814809):

Displaying 18 items.

• PORTA (Q17024) (← links)
• A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
• Combinatorial integral approximation (Q634784) (← links)
• Primary facets of order polytopes (Q730181) (← links)
• On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
• PANDA: a software for polyhedral transformations (Q904954) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Quasi-semi-metrics, oriented multi-cuts and related polyhedra (Q1582485) (← links)
• Extended formulations for order polytopes through network flows (Q1736010) (← links)
• The hypermetric cone and polytope on eight vertices and some generalizations (Q1745770) (← links)
• Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
• On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
• Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
• Classification of eight-dimensional perfect forms (Q3432119) (← links)
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)