The p-median polytype of Y-free graphs : an application of the matching theory
Year of publication: |
2008
|
---|---|
Authors: | Stauffer, Gautier |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 3, p. 351-354
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory | Matching |
-
Uniform concurrent multicommodity flow in product graphs
Shahrokhi, Farhad, (1992)
-
Almost all Berge graphs are perfect
Prömel, Hans Jürgen, (1991)
-
The max clique problem in classes of string-graphs
Middendorf, M., (1988)
- More ...
-
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Liebling, Thomas M., (2004)
-
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Liebling, Thomas M., (2004)
-
Robust modeling and planning: Insights from three industrial applications
Marla, Lavanya, (2020)
- More ...