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 Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multifacility ordered median problems on networks: A further analysis
Jörg Kalcsics
,
Stefan Nickel
,
Justo Puerto
Networks
41
(1), 2003, pp. 1-12
The SONET edge-partition problem
Olivier Goldschmidt
,
Dorit S. Hochbaum
,
Asaf Levin
,
Eli V. Olinick
Networks
41
(1), 2003, pp. 13-23
Upgrading trees under diameter and budget constraints
Victor Chepoi
,
Hartmut Noltemeier
,
Yann Vaxès
Networks
41
(1), 2003, pp. 24-35
Toward faster algorithms for dynamic traffic assignment - I. parametric quickest-path trees
Robert B. Dial
Networks
41
(1), 2003, pp. 36-43
Social network coordination and graph routing
Shmuel Onn
,
Elisheva Sperber
Networks
41
(1), 2003, pp. 44-50
Optimal rectangular partitions
Felipe C. Calheiros
,
Abilio Lucena
,
Cid C. de Souza
Networks
41
(1), 2003, pp. 51-67
Report: Some recent developments in Network Economics
Anna Nagurney
Networks
41
(1), 2003, pp. 68-72
Towards minimum
k
-geodetically connected graphs
Ján Plesník
Networks
41
(2), 2003, pp. 73-82
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
Jean-Claude Bermond
,
Stephan Ceroi
Networks
41
(2), 2003, pp. 83-86
Reserving resilient capacity for a single commodity with upper-bound constraints
G. Brightwell
,
G. Oriolo
,
F.B. Shepherd
Networks
41
(2), 2003, pp. 87-96
An improved algorithm for the minmax regret median problem on a tree
Igor Averbakh
,
Oded Berman
Networks
41
(2), 2003, pp. 97-103
A GRASP with path-relinking for private virtual circuit routing
Mauricio G.C. Resende
,
Celso C. Ribeiro
Networks
41
(2), 2003, pp. 104-114
A polynomial-time algorithm to find shortest paths with recourse
J. Scott Provan
Networks
41
(2), 2003, pp. 115-125
The single-vehicle routing problem with unrestricted backhauls
Haldun Süral
,
James H. Bookbinder
Networks
41
(3), 2003, pp. 127-136
Balanced network flows - VIII. A revised theory of phase-ordered algorithms and the
O(\sqrt nm \log(n^2/m) /log n)
bound for the nonbipartite cardinaltiy matching problem
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
41
(3), 2003, pp. 137-142
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
Francisco Ortega
,
Laurence A. Wolsey
Networks
41
(3), 2003, pp. 143-158
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Luis Gouveia
,
Thomas L. Magnanti
Networks
41
(3), 2003, pp. 159-173
Small-worlds: A review of recent books
I. Frommer
,
G. Pundoor
Networks
41
(3), 2003, pp. 174-180
Ernesto de Queirós Vieira Martins (1945-2000)
Mário S. (an appreciation by) Rosa
Networks
41
(4), 2003, pp. 181-183
The determination of the path with minimum-cost norm value
José M.P. Paixão
,
Ernesto de Queirós Vieira Martins
,
Mário S. Rosa
,
José Luis E. Santos
Networks
41
(4), 2003, pp. 184-196
Dynamic shortest paths minimizing travel times and costs
Ravindra K. Ahuja
,
James B. Orlin
,
Stefano Pallottino
,
Maria G. Scutellà
Networks
41
(4), 2003, pp. 197-205
A bicriterion approach for routing problems in multimedia networks
João C.N. Clímaco
,
José M.F. Craveirinha
,
Marta M.B. Pascoal
Networks
41
(4), 2003, pp. 206-220
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
Dalila B.M.M. Fontes
,
Eleni Hadjiconstantinou
,
Nicos Christofides
Networks
41
(4), 2003, pp. 221-228
A numerical tool for multiattribute ranking problems
Domingos Moreira Cardoso
,
Jorge Freire de Sousa
Networks
41
(4), 2003, pp. 229-234
Trees, slices, and wheels: On the floorplan area minimization problem
Ana Maria de Almeida
,
Rosália Rodrigues
Networks
41
(4), 2003, pp. 235-244