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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Benders decomposition approach for the robust network design problem with flow bifurcations
Chungmok Lee
,
Kyungsik Lee
,
Sungsoo Park
Networks
62
(1), 2013, pp. 1-16
A polyhedral study of the capacity formulation of the multilayer network design problem
Sara Mattia
Networks
62
(1), 2013, pp. 17-26
Local versus global search in channel graphs
A.H. Hunter
,
Nicholas Pippenger
Networks
62
(1), 2013, pp. 27-34
Distance edge coloring and collision-free communication in wireless sensor networks
Kaouther Drira
,
Hamida Seba
,
Brice Effantin
,
Hamamache Kheddouci
Networks
62
(1), 2013, pp. 35-47
Parametrized relocation of low-mobility resources
D. Jacob Wildstrom
Networks
62
(1), 2013, pp. 48-55
A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
Minghe Sun
Networks
62
(1), 2013, pp. 56-71
Search games on networks with travelling and search costs and with arbitrary searcher starting points
Vic Baston
,
Kensaku Kikuta
Networks
62
(1), 2013, pp. 72-79
A note on ``Multistage Methods for Freight Train Classification''
Dirk Briskorn
,
Florian Jaehn
Networks
62
(1), 2013, pp. 80-81
The price of anarchy in nonatomic consumption-relevance congestion games
Lasse Kliemann
Networks
62
(2), 2013, pp. 83-94
Efficient algorithms for a simple network design problem
Shin-ichi Nakano
,
Ryuhei Uehara
,
Takeaki Uno
Networks
62
(2), 2013, pp. 95-104
Computation of the optimal value function in time-dependent networks
Sebastian Kluge
,
Konrad Reif
,
Martin Brokate
Networks
62
(2), 2013, pp. 105-124
Complexity and approximability of the maximum flow problem with minimum quantities
Clemens Thielen
,
Stephan Westphal
Networks
62
(2), 2013, pp. 125-131
Analysis of an exact algorithm for the vessel speed optimization problem
Lars Magnus Hvattum
,
Inge Norstad
,
Kjetil Fagerholt
,
Gilbert Laporte
Networks
62
(2), 2013, pp. 132-135
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs
Balachandran Vaidyanathan
Networks
62
(2), 2013, pp. 136-148
Complexity of a classical flow restoration problem
Dritan Nace
,
Michaƚ Pióro
,
Artur Tomaszewski
,
Mateusz Żotkiewicz
Networks
62
(2), 2013, pp. 149-160
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad ``edge intersection graphs of single bend paths on a grid''
Martin Charles Golumbic
,
Marina Lipshteyn
,
Michal Stern
Networks
62
(2), 2013, pp. 161-163
Optimal edge-coloring with edge rate constraints
Dariusz Dereniowski
,
Wieslaw Kubiak
,
Bernard Ries
,
Yori Zwols
Networks
62
(3), 2013, pp. 165-182
A survey of resource constrained shortest path problems: Exact solution approaches
Luigi Di Puglia Pugliese
,
Francesca Guerriero
Networks
62
(3), 2013, pp. 183-200
Nonoblivious 2-Opt heuristics for the Traveling Salesman Problem
Asaf Levin
,
Uri Yovel
Networks
62
(3), 2013, pp. 201-219
Solutions to conjectures on the
(k,\ell)
-rainbow index of complete graphs
Qingqiong Cai
,
Xueliang Li
,
Jiangli Song
Networks
62
(3), 2013, pp. 220-224
Theoretical and computational advances for network diversion
Christopher A. Cullenbine
,
R. Kevin Wood
,
Alexandra M. Newman
Networks
62
(3), 2013, pp. 225-242
Effectiveness-equity models for facility location problems on tree networks
Miguel A. Lejeune
,
Srinivas Y. Prasad
Networks
62
(4), 2013, pp. 243-254
Robust capacity assignment solutions for telecommunications networks with uncertain demands
F. Babonneau
,
J.-P. Vial
,
O. Klopfenstein
,
A. Ouorou
Networks
62
(4), 2013, pp. 255-272
Decomposition algorithms for solving the minimum weight maximal matching problem
Merve Bodur
,
Tinaz Ekim
,
Z. Caner Taşkin
Networks
62
(4), 2013, pp. 273-287
Fast algorithms for convex cost flow problems on circles, lines, and trees
James B. Orlin
,
Balachandran Vaidyanathan
Networks
62
(4), 2013, pp. 288-296
Seiten 1
2
3
>