36 search results - page 4 / 8 » ol 2008 |
OL
2010
13 years 8 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
DM
2008
13 years 10 months ago
2008
OL
2008
13 years 9 months ago
2008
Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations f...
OL
2008
13 years 9 months ago
2008
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite programming. A corresponding Symmetric Reduction Lemma is s...
OL
2007
13 years 9 months ago
2007
Abstract The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + x...