Enumeration of the facets of cut polytopes over some highly symmetric graphs
Year of publication: |
September 2016
|
---|---|
Authors: | Deza, Michel ; Dutour Sikirić, Mathieu |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 5, p. 853-860
|
Subject: | enumeration | graph theory | polyhedra | branch and bound | combinatorial optimization | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Konferenzbeitrag ; Conference paper ; Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Other identifiers: | 10.1111/itor.12194 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Dolgui, A., (2009)
- More ...
-
A survey of the known facets of the cut cone
Deza, Michel, (1992)
-
Deza, Michel, (1991)
-
Variety of hypercube embeddings of the equidistant metric and desings
Deza, Michel, (1991)
- More ...