ZIB

1

Digitale Medien

Optimization of the flow through networks with gains (1972)

Maurras, Jean François

Springer

Mathematical programming 3 (1972), S. 135-144

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1436-4646

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract The optimal flow problem in networks with gains is presented through the simplex method. Out of simple theorical conditions, a method is built which needs only a relatively small number memory and quite a short calculation time by computer. Large examples are given; e.g., one test-example of 1000 nodes and 3000 arcs, and one real problem leading to a linear program of 3000 constraints and 8000 arcs.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01584985

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

2

Unbekannt

On the cardinality constrained matroid polytope (2009)

Maurras, Jean ; Stephan, Rüdiger

zur Merkliste hinzufügen auf der Merkliste

Details

Publikationsdatum: 2020-08-05

Sprache: Englisch

Materialart: other , doc-type:Other

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

OPUS

Überblick

3

Unbekannt

On the connectivity of k-clique polytopes (2010)

Stephan, Rüdiger ; Maurras, Jean ; Nedev, Roumen

zur Merkliste hinzufügen auf der Merkliste

Details

Publikationsdatum: 2020-11-17

Beschreibung: In this paper, we study the neighbourlicity of the polytope $P_{k n}^2$ constituted by the $k$-cliques of the complete graph $K_n$ on $n$ vertices. We prove that this polytope is $3$-, but not $4$-neighbourly. Following a remark of Pierre Duchet, we partially generalize this result to the $k$-clique polytopes of $r$-uniform complete hypergraphs, $P_{kn}^r$. We show that the neighbourlicity of $P_{kn}^r$ is between $r$ and $2^r-1$ whenever $k\geq r+1$ and $n\geq k+r+1$. Computational results indicate that the upper bound is tight.

Sprache: Englisch

Materialart: reportzib , doc-type:preprint

Format: application/pdf

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

OPUS

PDF

Überblick