On the skeleton of the metric polytope
We consider convex polyhedra with applications to well-known combinatorial optimization problems: the metric polytope m n and its relatives. For n ≤ 6 the description of the metric polytope is easy as m n has at most 544 vertices partitioned into 3 orbits; m 7 - the largest previously known instance...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2014
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/102099 http://hdl.handle.net/10220/18804 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|