A bipartite graph simplex method
Year of publication: |
2004
|
---|---|
Authors: | Euler, Reinhardt |
Published in: |
Operations research proceedings 2003 : selected papers of the International Conference on Operations Research (OR 2003), Heidelberg, September 3 - 5, 2003 ; with 51 tables. - Berlin : Springer, ISBN 3-540-21445-3. - 2004, p. 332-339
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Deskriptive Statistik | Descriptive statistics |
-
Degeneracy Graphs and Simplex Cycling
Zörnig, Peter, (1991)
-
Inverse chromatic number problems in interval and permutation graphs
Chung, Yerim, (2015)
-
Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7
Paschos, Vangelis Th., (2018)
- More ...
-
Escudero, Laureano, (1996)
-
On a composition of independence systems by circuit-identification
Euler, Reinhardt, (1985)
-
Rank-axiomatic characterizations of independence systems
Euler, Reinhardt, (1978)
- More ...