Networks, Volume 49

Volume 49, Number 1, January 2007

Luis Gouveia, Stefan Voß:
Preface. 1-2
Walid Ben-Ameur, José Neto:
Acceleration of cutting-plane and column generation algorithms: Applications to network design. 3-17
Adam Ouorou:
Implementing a proximal algorithm for some nonlinear multicommodity flow problems. 18-27
Pinar Z. Tan, Bahar Yetis Kara:
A hub covering model for cargo delivery systems. 28-39
Marcus Brazil, Doreen A. Thomas:
Network optimization for the design of underground mines. 40-50
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
Survivable IP network design with OSPF routing. 51-64
Luigi De Giovanni, Roberto Tadei:
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints. 65-79
Christophe Duhamel, Philippe Mahey:
Multicommodity flow problems with a bounded number of paths: A flow deviation approach. 80-89
Pietro Belotti, Federico Malucelli, Lorenzo Brunetta:
Multicommodity network design with discrete node costs. 90-99
Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Provisioning virtual private networks under traffic uncertainty. 100-115
David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau:
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. 116-133

David Huygens, Ali Ridha Mahjoub:
Integer programming formulations for the two 4-hop-constrained paths problem. 135-144
Jason I. Brown, Xiaohu Li:
Uniformly optimal digraphs for strongly connected reliability. 145-151
Min Lü, Guo-Liang Chen, Jun-Ming Xu:
On super edge-connectivity of Cartesian product graphs. 152-157
Jack Snoeyink:
Maximum independent set for intervals by divide and conquer with pruning. 158-159
Michal Penn, Stas Rozenfeld:
Approximation algorithm for the group Steiner network problem. 160-167
José Cáceres, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González:
Dilation-free graphs in the l₁ metric. 168-174
Izack Cohen, Boaz Golany, Avraham Shtub:
The stochastic time-cost tradeoff problem: A robust optimization approach. 175-188

Bruce L. Golden, Douglas R. Shier:
Editorial. 189
Arjang A. Assad:
Leonhard Euler: A brief appreciation. 190-198
Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte:
The bridges of Königsberg - A historical perspective. 199-203
Alan A. Bertossi, Maria Cristina Pinotti:
Approximate L(delta₁, delta₂, ..., delta_t)-coloring of trees and interval graphs. 204-216
Jean-Claude Bermond, Min-Li Yu:
Vertex disjoint routings of cycles over tori. 217-225
Mordecai J. Golin, Yan Zhang:
The two-median problem on Manhattan meshes. 226-233
Li Shang, Heping Zhang:
Sufficient conditions for graphs to be lambda'-optimal and super-lambda'. 234-242

Daniele Vigo, Paolo Toth, Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization. 243-244
Angel Corberán, Isaac Plana, José M. Sanchis:
A branch & cut algorithm for the windy general routing problem and special cases. 245-257
Stefan Ropke, Jean-François Cordeau, Gilbert Laporte:
Models and branch-and-cut algorithms for pickup and delivery problems with time windows. 258-272
Brian Kallehauge, Natashia Boland, Oli B. G. Madsen:
Path inequalities for the vehicle routing problem with time windows. 273-293
Karl F. Doerner, Guenther Fuellerer, Richard F. Hartl, Manfred Gronalt, Manuel Iori:
Metaheuristics for the vehicle routing problem with loading constraints. 294-307
Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems. 308-317
Si Chen, Bruce L. Golden, Edward A. Wasil:
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. 318-329
Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. 330-340

Last update Wed Feb 15 05:40:42 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page