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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An extended model and a column generation algorithm for the planar multicommodity flow problem
Filipe Alvelos
,
J.M. Valério de Carvalho
Networks
50
(1), 2007, pp. 3-16
Network design arc set with variable upper bounds
Alper Atamtürk
,
Oktay Günlük
Networks
50
(1), 2007, pp. 17-28
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
Andreas Bley
Networks
50
(1), 2007, pp. 29-36
Joint optimization of pricing and resource allocation in competitive telecommunications networks
Mustapha Bouhtou
,
Guillaume Erbs
,
Michel Minoux
Networks
50
(1), 2007, pp. 37-49
Hardness of robust network design
C. Chekuri
,
F.B. Shepherd
,
G. Oriolo
,
M.G. Scutellá
Networks
50
(1), 2007, pp. 50-54
Lower and upper bounds for the degree-constrained minimum spanning tree problem
Alexandre Salles da Cunha
,
Abilio Lucena
Networks
50
(1), 2007, pp. 55-66
Heuristic solutions for general concave minimum cost network flow problems
Dalila B.M.M. Fontes
,
José Fernando Gonçalves
Networks
50
(1), 2007, pp. 67-76
Incremental flow
Jeff Hartline
,
Alexa Sharp
Networks
50
(1), 2007, pp. 77-85
On the minimum path problem in Knödel graphs
Hovhannes A. Harutyunyan
,
Calin D. Morosan
Networks
50
(1), 2007, pp. 86-91
Locating a cycle in a transportation or a telecommunications network
Gilbert Laporte
,
Inmaculada Rodríguez Martín
Networks
50
(1), 2007, pp. 92-108
Multiperiod network design with incremental routing
Benoit Lardeux
,
Dritan Nace
,
Jérôme Geffard
Networks
50
(1), 2007, pp. 109-117
Linear time algorithms for approximating the Facility Terminal Cover problem
Guang Xu
,
Yang Yang
,
Jinhui Xu
Networks
50
(1), 2007, pp. 118-126
The 1-minimax and 1-maximin problems with demand weights of general probability distributions
Oded Berman
,
Jiamin Wang
Networks
50
(2), 2007, pp. 127-135
Robust capacity expansion of network flows
Fernando Ordóñez
,
Jiamin Zhao
Networks
50
(2), 2007, pp. 136-145
Panpositionable Hamiltonicity of the alternating group graphs
Yuan-Hsiang Teng
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Networks
50
(2), 2007, pp. 146-156
On stochastic programs over trees with partially dependent arc capacities
Ning Shi
,
Raymond K. Cheung
,
Haiqing Song
Networks
50
(2), 2007, pp. 157-163
Multiterminal resilience for series-parallel networks
Toni R. Farley
,
Charles J. Colbourn
Networks
50
(2), 2007, pp. 164-172
Matching preclusion for some interconnection networks
Eddie Cheng
,
László Lipták
Networks
50
(2), 2007, pp. 173-180
The maximum residual flow problem:
NP
-hardness with two-arc destruction
Donglei Du
,
R. Chandrasekaran
Networks
50
(3), 2007, pp. 181-182
Continuum approximation techniques for the design of integrated package distribution systems
Karen R. Smilowitz
,
Carlos F. Daganzo
Networks
50
(3), 2007, pp. 183-196
Some results about
f
-critical graphs
Guizhen Liu
,
Jianfeng Hou
,
Jiansheng Cai
Networks
50
(3), 2007, pp. 197-202
On tree 3-spanners in directed path graphs
B.S. Panda
,
Anita Das
Networks
50
(3), 2007, pp. 203-210
The vehicle rescheduling problem: Model and algorithms
Jing-Quan Li
,
Pitu B. Mirchandani
,
Denis Borenstein
Networks
50
(3), 2007, pp. 211-229
A linear-time algorithm for the
k
-fixed-endpoint path cover problem on cographs
Katerina Asdre
,
Stavros D. Nikolopoulos
Networks
50
(4), 2007, pp. 231-240
Large vertex symmetric digraphs
J. Gómez
Networks
50
(4), 2007, pp. 241-250
Seiten 1
2
3
>