Facets for the cut cone II: Clique-web inequalities

dc.contributor.author	Deza, Michel
dc.contributor.author	Laurent, Monique
dc.date.accessioned	2014-12-15T09:41:38Z
dc.date.available	2014-12-15T09:41:38Z
dc.date.issued	1992
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/14448
dc.language.iso	en	en
dc.subject	cone	en
dc.subject	polytope	en
dc.subject	facet	en
dc.subject	antiweb	en
dc.subject	cut	en
dc.subject	hypermetric inequality	en
dc.subject.ddc	519	en
dc.title	Facets for the cut cone II: Clique-web inequalities	en
dc.type	Article accepté pour publication ou publié
dc.description.abstracten	We study new classes of facets for the cut coneC n generated by the cuts of the complete graph onn vertices. This cone can also be interpreted as the cone of all semi-metrics onn points that are isometricallyl 1-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets ofC n . These new facets belong to the class of clique-web inequalities which generalize the hypermetric and cycle inequalities as well as the bicycle odd wheel inequalities.	en
dc.relation.isversionofjnlname	Mathematical Programming
dc.relation.isversionofjnlvol	56	en
dc.relation.isversionofjnlissue	1-3	en
dc.relation.isversionofjnldate	1992
dc.relation.isversionofjnlpages	161-188	en
dc.relation.isversionofdoi	http://dx.doi.org/10.1007/BF01580898	en
dc.relation.isversionofjnlpublisher	Springer	en
dc.subject.ddclabel	Probabilités et mathématiques appliquées	en
dc.relation.forthcoming	non	en
dc.relation.forthcomingprint	non	en

Related items