Publication View

Optimizing over Semimetric Polytopes (2009)

Abstract
Let G = (V, E) be a complete graph. Then the semimetric polytope M(G) associated with G is defined by the following system of inequalities xij + xik + xjk ≤ 2 ⎪⎬

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.136.2629
Source http://www.di.unipi.it/~frangio/papers/IPCO04.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English
Relation 10.1.1.31.258, 10.1.1.35.2430, 10.1.1.112.267, 10.1.1.12.7741