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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Walid Ben-Ameur
,
José Neto
Networks
49
(1), 2007, pp. 3-17
Implementing a proximal algorithm for some nonlinear multicommodity flow problems
Adam Ouorou
Networks
49
(1), 2007, pp. 18-27
A hub covering model for cargo delivery systems
Pinar Z. Tan
,
Bahar Y. Kara
Networks
49
(1), 2007, pp. 28-39
Network optimization for the design of underground mines
M. Brazil
,
D.A. Thomas
Networks
49
(1), 2007, pp. 40-50
Survivable IP network design with OSPF routing
L.S. Buriol
,
M.G.C. Resende
,
M. Thorup
Networks
49
(1), 2007, pp. 51-64
Tailoring neighborhood search for the Internet Protocol Network Design Problem with Reliability and Routing Constraints
L. De Giovanni
,
R. Tadei
Networks
49
(1), 2007, pp. 65-79
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Christophe Duhamel
,
Philippe Mahey
Networks
49
(1), 2007, pp. 80-89
Multicommodity network design with discrete node costs
P. Belotti
,
F. Malucelli
,
L. Brunetta
Networks
49
(1), 2007, pp. 90-99
Provisioning virtual private networks under traffic uncertainty
A. Altın
,
E. Amaldi
,
P. Belotti
,
M.Ç. Pınar
Networks
49
(1), 2007, pp. 100-115
The two-edge connected Hop-constrained Network Design Problem: Valid inequalities and branch-and-cut
David Huygens
,
Martine Labbé
,
A. Ridha Mahjoub
,
Pierre Pesneau
Networks
49
(1), 2007, pp. 116-133
Integer programming formulations for the two 4-hop-constrained paths problem
David Huygens
,
A. Ridha Mahjoub
Networks
49
(2), 2007, pp. 135-144
Uniformly optimal digraphs for strongly connected reliability
J.I. Brown
,
Xiaohu Li
Networks
49
(2), 2007, pp. 145-151
On super edge-connectivity of Cartesian product graphs
Min Lü
,
Guo-Liang Chen
,
Jun-Ming Xu
Networks
49
(2), 2007, pp. 152-157
Maximum independent set for intervals by divide and conquer with pruning
Jack Snoeyink
Networks
49
(2), 2007, pp. 158-159
Approximation algorithm for the group Steiner network problem
Michal Penn
,
Stas Rozenfeld
Networks
49
(2), 2007, pp. 160-167
Dilation-free graphs in the
l_1
metric
J. Cáceres
,
C.I. Grima
,
A. Márquez
,
A. Moreno-González
Networks
49
(2), 2007, pp. 168-174
The stochastic time-cost tradeoff problem: A robust optimization approach
Izack Cohen
,
Boaz Golany
,
Avraham Shtub
Networks
49
(2), 2007, pp. 175-188
Leonhard Euler: A brief appreciation
Arjang A. Assad
Networks
49
(3), 2007, pp. 190-198
The bridges of Königsberg - A historical perspective
Irina Gribkovskaia
,
Øyvind Halskau Sr.
,
Gilbert Laporte
Networks
49
(3), 2007, pp. 199-203
Approximate
L(\delta_1, \delta_2, ..., \delta_t)
-coloring of trees and interval graphs
Alan A. Bertossi
,
Cristina M. Pinotti
Networks
49
(3), 2007, pp. 204-216
Vertex disjoint routings of cycles over tori
Jean-Claude Bermond
,
Min-Li Yu
Networks
49
(3), 2007, pp. 217-225
The two-median problem on Manhattan meshes
Mordecai J. Golin
,
Yan Zhang
Networks
49
(3), 2007, pp. 226-233
Sufficient conditions for graphs to be
\lambda ^\prime
-optimal and super-
\lambda ^\prime
Li Shang
,
Heping Zhang
Networks
49
(3), 2007, pp. 234-242
A branch & cut algorithm for the windy general routing problem and special cases
Angel Corberán
,
Isaac Plana
,
José M. Sanchis
Networks
49
(4), 2007, pp. 245-257
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
Stefan Ropke
,
Jean-François Cordeau
,
Gilbert Laporte
Networks
49
(4), 2007, pp. 258-272
Seiten 1
2
>