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=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Periodic railway timetabling with event flexibility
Gabrio Caimi
,
Martin Fuchsberger
,
Marco Laumanns
,
Kaspar Schüpbach
Networks
57
(1), 2011, pp. 3-18
How to find good night train connections
Thorsten Gunkel
,
Mathias Schnee
,
Matthias Müller-Hannemann
Networks
57
(1), 2011, pp. 19-27
A note on the online nature of the railway delay management problem
Natalia Kliewer
,
Leena Suhl
Networks
57
(1), 2011, pp. 28-37
Experimental study of speed up techniques for timetable information systems
Reinhard Bauer
,
Daniel Delling
,
Dorothea Wagner
Networks
57
(1), 2011, pp. 38-52
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Luigi Moccia
,
Jean-François Cordeau
,
Gilbert Laporte
,
Stefan Ropke
,
Maria Pia Valentini
Networks
57
(1), 2011, pp. 53-68
A MIP-based local search method for the railway rescheduling problem
Rodrigo Acuna-Agost
,
Philippe Michelon
,
Dominique Feillet
,
Serigne Gueye
Networks
57
(1), 2011, pp. 69-86
Multistage methods for freight train classification
Riko Jacob
,
Peter Márton
,
Jens Maue
,
Marc Nunkesser
Networks
57
(1), 2011, pp. 87-105
Line planning, path constrained network flow and inapproximability
Christina Büsing
,
Sebastian Stiller
Networks
57
(1), 2011, pp. 106-113
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
Shenwei Huang
,
Erfang Shan
Networks
57
(2), 2011, pp. 115-116
Stackelberg network pricing is hard to approximate
Gwenaë Joret
Networks
57
(2), 2011, pp. 117-120
Constructions of small regular bipartite graphs of girth 6
G. Araujo-Pardo
,
Camino Balbuena
Networks
57
(2), 2011, pp. 121-127
Single-vehicle scheduling problems with release and service times on a line
Wei Yu
,
Zhaohui Liu
Networks
57
(2), 2011, pp. 128-134
A minimum cost flow formulation for approximated MLC segmentation
Thomas Kalinowski
Networks
57
(2), 2011, pp. 135-140
On cut-based inequalities for capacitated network design polyhedra
Christian Raack
,
Arie M.C.A. Koster
,
Sebastian Orlowski
,
Roland Wessäly
Networks
57
(2), 2011, pp. 141-156
Nonadaptive broadcasting in trees
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Kazuhisa Makino
,
Thomas C. Shermer
Networks
57
(2), 2011, pp. 157-168
Earliest arrival flows on series-parallel graphs
Stefan Ruzika
,
Heike Sperber
,
Mechthild Steiner
Networks
57
(2), 2011, pp. 169-173
On terminal delta-wye reducibility of planar graphs
Isidoro Gitler
,
Feliú Sagols
Networks
57
(2), 2011, pp. 174-186
Optimal online ring routing
Jessen T. Havill
,
Kevin R. Hutson
Networks
57
(2), 2011, pp. 187-197
Optimal power control in OFDMA cellular networks
Paolo Detti
,
Gaia Nicosia
,
Andrea Pacifici
,
Mara Servilio
Networks
57
(3), 2011, pp. 200-211
Exact algorithms for the vertex separator problem in graphs
Cid C. de Souza
,
Victor F. Cavalcante
Networks
57
(3), 2011, pp. 212-230
A multistart heuristic for the equality generalized Traveling Salesman Problem
Valentina Cacchiani
,
Albert Einstein Fernandes Muritiba
,
Marcos Negreiros
,
Paolo Toth
Networks
57
(3), 2011, pp. 231-239
On the cardinality constrained matroid polytope
Jean François Maurras
,
Rüdiger Stephan
Networks
57
(3), 2011, pp. 240-246
On LP relaxations for the pattern minimization problem
Alessandro Aloisio
,
Claudio Arbib
,
Fabrizio Marinelli
Networks
57
(3), 2011, pp. 247-253
On minimum reload cost paths, tours, and flows
Edoardo Amaldi
,
Giulia Galbiati
,
Francesco Maffioli
Networks
57
(3), 2011, pp. 254-260
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
Raphael C.S. Machado
,
Celina M.H. de Figueiredo
Networks
57
(3), 2011, pp. 261-269
Seiten 1
2
>