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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Packing cuts in undirected graphs
Alberto Caprara
,
Alessandro Panconesi
,
Romeo Rizzi
Networks
44
(1), 2004, pp. 1-11
A stochastic integer programming approach to solving a synchronous optical network ring design problem
J. Cole Smith
,
Andrew J. Schaefer
,
Joyce W. Yen
Networks
44
(1), 2004, pp. 12-26
Some recent contributions to network optimization
Walid Ben-Ameur
,
Luis Gouveia
Networks
44
(1), 2004, pp. 27-30
Solving the asymmetric Traveling Salesman Problem with periodic constraints
Giuseppe Paletta
,
Chefi Triki
Networks
44
(1), 2004, pp. 31-37
An improved algorithm for the distance constrained
p
-center location problem with mutual communication on tree networks
Arie Tamir
Networks
44
(1), 2004, pp. 38-40
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
Brian C. Dean
Networks
44
(1), 2004, pp. 41-46
Probabilistic location problems with discrete demand weights
Oded Berman
,
Jiamin Wang
Networks
44
(1), 2004, pp. 47-57
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
Matteo Fischetti
,
Carlo Polo
,
Massimo Scantamburlo
Networks
44
(2), 2004, pp. 61-72
On the impact of the solution representation for the internet protocol network design problem with max-hop constraints
L. de Giovanni
,
F. Della Croce
,
R. Tadei
Networks
44
(2), 2004, pp. 73-83
Projecting the flow variables for hub location problems
Martine Labbé
,
Hande Yaman
Networks
44
(2), 2004, pp. 84-93
Solving the hub location problem in telecommunication network design: A local search approach
G. Carello
,
F. Della Croce
,
M. Ghirardi
,
R. Tadei
Networks
44
(2), 2004, pp. 94-105
Grid scheduling by on-line rectangle packing
Massimiliano Caramia
,
Stefano Giordani
,
Antonio Iovanella
Networks
44
(2), 2004, pp. 106-119
Cardinality constrained path covering problems in grid graphs
N. Apollonio
,
L. Caccetta
,
B. Simeone
Networks
44
(2), 2004, pp. 120-131
A competitive scheduling problem and its relevance to UMTS channel assignment
Claudio Arbib
,
Stefano Smriglio
,
Mara Servilio
Networks
44
(2), 2004, pp. 132-141
Decomposition techniques for the minimum toll revenue problem
Lihui Bai
,
Donald W. Hearn
,
Siriphong Lawphongpanich
Networks
44
(2), 2004, pp. 142-150
An implicit enumeration scheme for the batch selection problem
A. Agnetis
,
F. Rossi
,
S. Smriglio
Networks
44
(2), 2004, pp. 151-159
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Ravindra K. Ahuja
,
Jian Liu
,
James B. Orlin
,
Jon Goodstein
,
Amit Mukherjee
Networks
44
(2), 2004, pp. 160-171
Embedding of cycles and wheels into arbitrary trees
Indra Rajasingh
,
Albert William
,
Jasintha Quadras
,
Paul Manuel
Networks
44
(3), 2004, pp. 173-178
Trade-offs on the location of the core node in a network
Jean-François Macq
,
Michel X. Goemans
Networks
44
(3), 2004, pp. 179-186
Optimal grid representations
M.H.C. Fampa
,
S. Klein
,
F. Protti
,
D.C.A. Rêgo
Networks
44
(3), 2004, pp. 187-193
The ring grooming problem
Timothy Y. Chow
,
Philip J. Lin
Networks
44
(3), 2004, pp. 194-202
Approximation algorithms for finding low-degree subgraphs
Philip N. Klein
,
Radha Krishnan
,
Balaji Raghavachari
,
R. Ravi
Networks
44
(3), 2004, pp. 203-215
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
Dominique Feillet
,
Pierre Dejax
,
Michel Gendreau
,
Cyrille Gueguen
Networks
44
(3), 2004, pp. 216-229
Bounding vertex coloring by truncated multistage branch and bound
Massimiliano Caramia
,
Paolo Dell'Olmo
Networks
44
(4), 2004, pp. 231-242
Minimum
k
-geodetically connected digraphs
Ján Plesník
Networks
44
(4), 2004, pp. 243-253
Seiten 1
2
3
>