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=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integer programming models and algorithms for the graph decontamination problem with mobile agents
John Penuel
,
J. Cole Smith
,
Siqian Shen
Networks
61
(1), 2013, pp. 1-19
On the super-restricted arc-connectivity of
s
-geodetic digraphs
Camino Balbuena
,
Pedro García-Vázquez
,
Adriana Hansberg
,
Luis Pedro Montejano
Networks
61
(1), 2013, pp. 20-28
Proximity graphs inside large weighted graphs
Bernardo M. Ábrego
,
Ruy Fabila-Monroy
,
Silvia Fernández-Merchant
,
David Flores-Peñaloza
,
Ferran Hurtado
,
Henk Meijer
,
Vera Sacristán
,
Maria Saumell
Networks
61
(1), 2013, pp. 29-39
Simplifications and speedups of the pseudoflow algorithm
Dorit S. Hochbaum
,
James B. Orlin
Networks
61
(1), 2013, pp. 40-57
A branch-and-bound algorithm for the double Travelling Salesman Problem with two stacks
Francesco Carrabs
,
Raffaele Cerulli
,
Maria Grazia Speranza
Networks
61
(1), 2013, pp. 58-75
Robust mean absolute deviation problems on networks with linear vertex weights
M.C. López-de-los-Mozos
,
J. Puerto
,
A.M. Rodríguez-Chía
Networks
61
(1), 2013, pp. 76-85
A branch-and-cut algorithm for the ring spur assignment problem
Paula Carroll
,
Bernard Fortz
,
Martine Labbé
,
Seán McGarraghy
Networks
61
(2), 2013, pp. 89-103
The orienteering problem with variable profits
Güneş Erdog̑an
,
Gilbert Laporte
Networks
61
(2), 2013, pp. 104-116
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
K.C. Hastings
,
D.R. Shier
Networks
61
(2), 2013, pp. 117-127
Robust network design: Formulations, valid inequalities, and computations
Arie M.C.A. Koster
,
Manuel Kutschka
,
Christian Raack
Networks
61
(2), 2013, pp. 128-149
Stabilizing branch-and-price for constrained tree problems
Markus Leitner
,
Mario Ruthmair
,
Günther R. Raidl
Networks
61
(2), 2013, pp. 150-170
Hop-level flow formulation for the survivable network design with hop constraints problem
A. Ridha Mahjoub
,
Luidi Simonetti
,
Eduardo Uchoa
Networks
61
(2), 2013, pp. 171-179
Affine recourse for the robust network design problem: Between static and dynamic routing
Michael Poss
,
Christian Raack
Networks
61
(2), 2013, pp. 180-198
Balancing profits and costs on trees
Sofie Coene
,
Carlo Filippi
,
Frits C.R. Spieksma
,
Elisa Stevanato
Networks
61
(3), 2013, pp. 200-211
Tolerant identification with Euclidean balls
Ville Junnila
,
Tero Laihonen
,
Aline Parreau
Networks
61
(3), 2013, pp. 212-225
Routing and scheduling for energy and delay minimization in the powerdown model
Matthew Andrews
,
Antonio Fernández Anta
,
Lisa Zhang
,
Wenbo Zhao
Networks
61
(3), 2013, pp. 226-237
The Gilbert arborescence problem
M.G. Volz
,
M. Brazil
,
C.J. Ras
,
K.J. Swanepoel
,
D.A. Thomas
Networks
61
(3), 2013, pp. 238-247
Integrated job scheduling and network routing
Mette Gamst
,
David Pisinger
Networks
61
(3), 2013, pp. 248-262
On building multiple spanning trees and VLAN assignment in metro Ethernet networks
Aref Meddeb
Networks
61
(3), 2013, pp. 263-280
Linearly many faults in arrangement graphs
Eddie Cheng
,
László Lipták
,
Allen Yuan
Networks
61
(4), 2013, pp. 281-289
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
Anupam Seth
,
Diego Klabjan
,
Placid M. Ferreira
Networks
61
(4), 2013, pp. 290-308
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
Luis Gouveia
,
Jorge Riera-Ledesma
,
Juan-José Salazar-González
Networks
61
(4), 2013, pp. 309-321
Shortest paths avoiding forbidden subpaths
Mustaq Ahmed
,
Anna Lubiw
Networks
61
(4), 2013, pp. 322-334
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
Walid Ben-Ameur
,
Makhlouf Hadji
,
Adam Ouorou
Networks
61
(4), 2013, pp. 335-355