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...

Full description

Saved in:
Bibliographic Details
Main Authors: Deza, Antoine., Fukuda, Komei., Pasechnik, Dmitrii V., Sato, Masanori.
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2014
Subjects:
Online Access:https://hdl.handle.net/10356/102099
http://hdl.handle.net/10220/18804
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English