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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Michel Gendreau
,
Manuel Iori
,
Gilbert Laporte
,
Silvaro Martello
Networks
51
(1), 2008, pp. 4-18
Solving the hub location problem in a star-star network
Martine Labbé
,
Hande Yaman
Networks
51
(1), 2008, pp. 19-33
Models and heuristics for a minimum arborescence problem
Christophe Duhamel
,
Luis Gouveia
,
Pedro Moura
,
Mauricio Souza
Networks
51
(1), 2008, pp. 34-47
New approaches for solving the block-to-train assignment problem
Krishna C. Jha
,
Ravindra K. Ahuja
,
Güvenç Şahin
Networks
51
(1), 2008, pp. 48-62
A simple method for improving the primal simplex method for the multicommodity flow problem
Agustín Bompadre
,
James B. Orlin
Networks
51
(1), 2008, pp. 63-77
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
N. Apollonio
,
I. Lari
,
F. Ricca
,
B. Simeone
,
J. Puerto
Networks
51
(1), 2008, pp. 78-89
Some edge-fault-tolerant properties of the folded hypercube
Sun-Yuan Hsieh
Networks
51
(2), 2008, pp. 92-101
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case
Maria G. Scutellà
Networks
51
(2), 2008, pp. 102-112
Transversals of subtree hypergraphs and the source location problem in digraphs
Jan van den Heuvel
,
Matthew Johnson
Networks
51
(2), 2008, pp. 113-119
New facets for the planar subgraph polytope
Illya V. Hicks
Networks
51
(2), 2008, pp. 120-132
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
Mauricio C. de Souza
,
Philippe Mahey
,
Bernard Gendron
Networks
51
(2), 2008, pp. 133-141
A graph theory approach for designing conservation reserve networks with minimal fragmentation
Hayri Önal
,
Yicheng Wang
Networks
51
(2), 2008, pp. 142-152
Erratum to ``A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints''
Michel Gendreau
,
Manuel Iori
,
Gilbert Laporte
,
Silvano Martello
Networks
51
(2), 2008, pp. 153-153
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Giovanni Righini
,
Matteo Salani
Networks
51
(3), 2008, pp. 155-170
w
-Rabin numbers and strong
w
-Rabin numbers of folded hypercubes
Cheng-Nan Lai
,
Gen-Huey Chen
Networks
51
(3), 2008, pp. 171-177
The computational complexity of graph contractions I: Polynomially solvable and
NP
-complete cases
Asaf Levin
,
Daniel Paulusma
,
Gerhard J. Woeginger
Networks
51
(3), 2008, pp. 178-189
The fractional congestion bound for efficient edge disjoint routing
Alok Baveja
Networks
51
(3), 2008, pp. 190-199
Sufficient conditions for a graph to be super restricted edge-connected
Shiying Wang
,
Shangwei Lin
Networks
51
(3), 2008, pp. 200-209
Techniques for analyzing dynamic random graph models of web-like networks: An overview
Aurel Cami
,
Narsingh Deo
Networks
51
(4), 2008, pp. 211-255
On a graph coloring problem arising from discrete tomography
C. Bentz
,
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Networks
51
(4), 2008, pp. 256-267