Volume 55,
Number 1,
January 2010
Networks Optimization Workshop,
August 22-25,
2006
- Dominique Feillet, Gilbert Laporte, Frédéric Semet:
Preface.
1
- Patrick Jaillet, Michael R. Wagner:
Almost sure asymptotic optimality for online routing and machine scheduling problems.
2-12
- Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem.
13-32
- Jérôme Truffot, Christophe Duhamel, Philippe Mahey:
k-Splittable delay constrained routing problem: A branch-and-price approach.
33-45
- Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.
46-59
Volume 55,
Number 2,
March 2010
- Elisabeth Gassner, Bettina Klinz:
A fast parametric assignment algorithm with applications in max-algebra.
61-77
- H. Edwin Romeijn, Thomas C. Sharkey, Zuo-Jun Max Shen, Jiawei Zhang:
Integrating facility location and production planning decisions.
78-89
- Eddie Cheng, László Lipták, Fred Sala:
Linearly many faults in 2-tree-generated networks.
90-98
- Jiamin Wang:
The beta-reliable minimax and maximin location problems on a network with probabilistic weights.
99-107
- Artur Tomaszewski, Michal Pióro, Mateusz Zotkiewicz:
On the complexity of resilient network design.
108-118
- Zhao Zhang, Qinghai Liu:
Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter.
119-124
- Thomas Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen:
Optimal routing with failure-independent path protection.
125-137
- Céline Engelbeen, Samuel Fiorini:
Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy.
138-148
- Ambrose Kofi Laing, David W. Krumme:
Optimal permutation routing for low-dimensional hypercubes.
149-167
Volume 55,
Number 3,
May 2010
Network Optimization (INOC 2007)
- Bernard Fortz, Luis Gouveia:
Editorial.
169-170
- Tolga Bektas, Mervat Chouman, Teodor Gabriel Crainic:
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.
171-180
- Gary Gordon, Ekaterina Jager:
Distinguished vertices in probabilistic rooted graphs.
181-186
- Abdel Lisser, Rafael Lopez:
Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA.
187-193
- Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for partition coloring.
194-204
- Si Chen, Ivana Ljubic, S. Raghavan:
The regenerator location problem.
205-220
- Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli:
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation.
221-233
- Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
A polyhedral study of the network pricing problem with connected toll arcs.
234-246
- Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.
247-255
- Bin Hu, Markus Leitner, Günther R. Raidl:
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search.
256-275
- Sebastian Orlowski, Roland Wessäly, Michal Pióro, Artur Tomaszewski:
SNDlib 1.0 - Survivable Network Design Library.
276-286
- Song Guo, Victor C. M. Leung:
Exact and performance-guaranteed multicast algorithms for lifetime optimization in WANETs.
287-297
Volume 55,
Number 4,
July 2010
- Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling:
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation.
299-325
- Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc:
Minimal selectors and fault tolerant networks.
326-340
- Alison Thomson, Sanming Zhou:
Gossiping and routing in undirected triple-loop networks.
341-349
- Cory J. Butz, Shan Hua, Ken Konkel, Hong Yao:
Join tree propagation with prioritized messages.
350-359
- Gary Chartrand, Futaba Okamoto, Ping Zhang:
Rainbow trees in graphs and generalized connectivity.
360-367
- John Kleppe, Marieke Quant, Hans Reijnierse:
Public congestion network situations and related games.
368-378
- Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero:
Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem.
379-385
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
