Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Journal=Networks AND Volume=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational development of a Lagrangian dual approach for quadratic networks
Jose A. Ventura
Networks
21
(4), 1991, pp. 469-485
Average properties of two-dimensional partial orders
J.B. Sidney
,
S.J. Sidney
,
A. Warburton
Networks
21
(5), 1991, pp. 487-503
Efficient algorithms for generalized cut-trees
Dan Gusfield
,
Dalit Naor
Networks
21
(5), 1991, pp. 505-520
On dependence and reliability computations
Thore Egeland
,
Arne Bang Huseby
Networks
21
(5), 1991, pp. 521-545
A two-commodity sharing problem on networks
Tetsuo Ichimori
,
Naoki Katoh
Networks
21
(5), 1991, pp. 547-563
Solution properties of oligopolistic network equilibria
Yuping Qiu
Networks
21
(5), 1991, pp. 565-580
Computing rooted communication reliability in an almost acyclic digraph
Jane Nichols Hagstrom
Networks
21
(5), 1991, pp. 581-593
The cut cone,
L^1
embeddability, complexity, and multicommodity flows
David Avis
,
Michel Deza
Networks
21
(6), 1991, pp. 595-617
Solving multistage stochastic networks: An application of scenario aggregation
John M. Mulvey
,
Hercules Vladimirou
Networks
21
(6), 1991, pp. 619-643
Maximum flows in probabilistic networks
Hiroshi Nagamochi
,
Toshihide Ibaraki
Networks
21
(6), 1991, pp. 645-666
Balanced spanning forests and trees
Agha Iqbal Ali
,
Chung-Hsing Huang
Networks
21
(6), 1991, pp. 667-687
Approximate solutions of capacitated fixed-charge minimum cost network flow problems
Do Ba Khang
,
Okitsugu Fujiwara
Networks
21
(6), 1991, pp. 689-704
A primal-dual algorithm for the minimum average weighted length circuit problem
Chengen Yang
,
Dayong Jin
Networks
21
(7), 1991, pp. 705-712
Sensitivity analysis of 0-1 multiterminal network flows
Shiow C. Lin
,
Eva Ma
Networks
21
(7), 1991, pp. 713-745
A multiphase approach to the period routing problem
Robert A. Russell
,
Dave Gribbin
Networks
21
(7), 1991, pp. 747-765
Minimum flows in
(s,t
planar networks
V. Adlakha
,
B. Gladysz
,
J. Kamburowski
Networks
21
(7), 1991, pp. 767-773
Characterizing stochastic flow networks using the Monte Carlo method
Christos Alexopoulos
,
George S. Fishman
Networks
21
(7), 1991, pp. 775-798
Seiten
<
1
2