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
[2]
Hilfe
Suche: Journal=Networks AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal multifacility defensive location on planes with rectilinear distances
Dan Trietsch
Networks
23
(6), 1993, pp. 517-523
A branch and bound algorithm for the capacitated minimum spanning tree problem
Kavindra Malik
,
Gang Yu
Networks
23
(6), 1993, pp. 525-532
Finding all minimum-size separating vertex sets in a graph
Arkady Kanevsky
Networks
23
(6), 1993, pp. 533-541
On locating path- or tree-shaped facilites on networks
S.L. Hakimi
,
E.F. Schmeichel
,
Martine Labbé
Networks
23
(6), 1993, pp. 543-555
A differential game model of nash equilibrium on a congested traffic network
Byung-Wook Wie
Networks
23
(6), 1993, pp. 557-565
Finding minimum cost to time ratio cycles with small integral transit times
Mark Hartmann
,
James B. Orlin
Networks
23
(6), 1993, pp. 567-574
Bounding procedures for multistage stochastic dynamic networks
Linos F. Frantzeskakis
,
Warren B. Powell
Networks
23
(7), 1993, pp. 575-595
Determining efficient facility locations on a tree network operating as a FIFO
M/G/1
queue
Srinivas Y. Prasad
,
Rajan Batta
Networks
23
(7), 1993, pp. 597-603
Sensitivity analysis in stochastic flow networks using the Monte Carlo method
Christos Alexopoulos
,
George S. Fishman
Networks
23
(7), 1993, pp. 605-621
Backordering in a multiperiod transshipment network
Richard A. Sandbothe
Networks
23
(7), 1993, pp. 623-630
A two-commodity flow formulation for the Traveling Salesman and the makespan problems with time windows
André Langewin
,
Martin Desrochers
,
Jacques Desrosiers
,
Sylvie Gélinas
,
François Soumis
Networks
23
(7), 1993, pp. 631-640
Cycle prefix digraphs for symmetric interconnection networks
Vance Faber
,
James W. Moore
,
William Y.C. Chen
Networks
23
(7), 1993, pp. 641-649
Some graph-theoretical models for scheduling in automated production systems
D. de Werra
,
Ph. Solot
Networks
23
(8), 1993, pp. 651-660
Parallel iterative search methods for vehicle routing problems
É. Taillard
Networks
23
(8), 1993, pp. 661-673
On stochastic spanning tree problem
S. Geetha
,
K.P.K. Nair
Networks
23
(8), 1993, pp. 675-679
The dynamic predicate stashing copy problem
Brunilde Sansó
,
François Soumis
Networks
23
(8), 1993, pp. 681-690
Optimal communication in networks with randomly distributed Byzantine faults
Douglas M. Blough
,
Andrzej Pelc
Networks
23
(8), 1993, pp. 691-701
A simple and fast label correcting algorithm for shortest paths
Dimitri P. Bertsekas
Networks
23
(8), 1993, pp. 703-709
Seiten
<
1
2
3