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
Hilfe
Suche: Journal=Networks AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-summetric quadratic assignment problem
Merrill M. Flood
Networks
20
(1), 1990, pp. 1-23
A network model for the rotating workforce scheduling problem
Nagraj Balakrishnan
,
Richard T. Wong
Networks
20
(1), 1990, pp. 25-42
An algorithmic note on the Gallai-Milgram Theorem
Kathie Cameron
Networks
20
(1), 1990, pp. 43-48
An airline tail routing algorithm for periodic schedules
Richard D. Wollmer
Networks
20
(1), 1990, pp. 49-54
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
Shlomo Moran
,
Ilan Newman
,
Yaron Wolfstahl
Networks
20
(1), 1990, pp. 55-64
Directed network reliability: Domination and computing coefficients of the success-marginal expansion
Jane Nichols Hagstrom
Networks
20
(1), 1990, pp. 65-78
Anti-stalling Pivot rules for the network simplex algorithm
Donald Goldfarb
,
Jianxiu Hao
,
Sheng-Roan Kai
Networks
20
(1), 1990, pp. 79-91
Interconnecting networks in the plane: The Steiner case
Dan Trietsch
Networks
20
(1), 1990, pp. 93-108
Faster exact algorithms for Steiner trees in planar networks
Marshall Bern
Networks
20
(1), 1990, pp. 109-120
The stochastic multicommodity flow problem
Hossein Soroush
,
Pitu B. Mirchandani
Networks
20
(2), 1990, pp. 121-155
Efficient algorithms for finding maximum cliques of an overlap graph
Sumio Masuda
,
Kazuo Nakajima
,
Toshinobu Kashiwabara
,
Toshio Fujisawa
Networks
20
(2), 1990, pp. 157-171
A combinatorial problem related to distributed loop networks
D.-Z. Du
,
D.F. Hsu
,
Qiao Li
,
Junming Xu
Networks
20
(2), 1990, pp. 173-180
A class of bounded approximation algorithms for graph partitioning
Thomas A. Feo
,
Mallek Khellaf
Networks
20
(2), 1990, pp. 181-195
Location of an obnoxious facility on a network: A voting approach
Martine Labbé
Networks
20
(2), 1990, pp. 197-207
On cost allocation in communication networks
Daniel Granot
,
Mehran Hojati
Networks
20
(2), 1990, pp. 209-229
Computing the probability distribution of project duration in a PERT network
Jane N. Hagstrom
Networks
20
(2), 1990, pp. 231-244
The probabilistic minimum spanning tree problem
Dimitris J. Bertsimas
Networks
20
(3), 1990, pp. 245-275
Combining Monte Carlo estimates and bounds for network reliability
Louis D. Nel
,
Charlees J. Colbourn
Networks
20
(3), 1990, pp. 277-298
A characterization of partial 3-trees
A. Satyanarayana
,
L. Tung
Networks
20
(3), 1990, pp. 299-322
Fair dissections of spiders, worms, and caterpillars
Caterina de Simone
,
Mario Lucertini
,
Stefano Pallottino
,
Bruno Simeone
Networks
20
(3), 1990, pp. 323-344
An application of Langrangean decomposition to the resource-constrained minimum weighted arborescence problem
Monique Guignard
,
Moshe B. Rosenwein
Networks
20
(3), 1990, pp. 345-359
Disjoint
(s,t)
-cuts in a network
Donald K. Wagner
Networks
20
(4), 1990, pp. 361-371
A heuristic algorithm for a network problem with variable upper bounds
Bala Shetty
Networks
20
(4), 1990, pp. 373-389
Optimal location of a path or tree on a network with cycles
Michael B. Richey
Networks
20
(4), 1990, pp. 391-407
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
Hiroshi Nagamochi
,
Masao Fukushima
,
Toshihide Ibaraki
Networks
20
(4), 1990, pp. 409-426
Seiten 1
2
>