default search action
Networks, Volume 54
Volume 54, Number 1, August 2009
- Sun-Yuan Hsieh, Tsong-Jie Lin:
Panconnectivity and edge-pancyclicity of k-ary n-cubes. 1-11 - Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
, Alfredo Navarra
On the complexity of distributed graph coloring with local minimality constraints. 12-19 - Yuuki Tanaka, Yukio Shibata:
A note on the k-degree Cayley graph. 20-22 - Andreas Bley
Approximability of unsplittable shortest path routing problems. 23-46 - Egon Balas, Rüdiger Stephan:
On the cycle polytope of a directed graph and its relaxations. 47-55 - Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. 56-67
Volume 54, Number 2, September 2009
- Charles L. Suffel:
A eulogy for Frank Boesch. 69 - Peter J. Slater:
Liar's domination. 70-74 - Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang:
The rainbow connectivity of a graph. 75-81 - Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo:
A generalization of an edge-connectivity theorem of Chartrand. 82-89 - Louis Petingi, M. Talafha:
Packing the Steiner trees of a graph. 90-94 - Douglas Bauer
Sufficient degree conditions for k-edge-connectedness of a graph. 95-98 - Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
A survey of some network reliability analysis and synthesis results. 99-107 - Jason I. Brown, Karl Dilcher:
On the roots of strongly connected reliability polynomials. 108-116
Volume 54, Number 3, October 2009
- Hui Chen, Ann Melissa Campbell
Minimax flow tree problems. 117-129 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. 130-138 - Yogesh Kumar Agarwal
Polyhedral structure of the 4-node network design problem. 139-149 - Frédéric Havet, Ross J. Kang
Improper coloring of unit disk graphs. 150-164
Volume 54, Number 4, December 2009
- Alan L. Erera, Martin W. P. Savelsbergh
ROUTE 2007: Recent advances in vehicle routing optimization. 165-166 - Artur Alves Pessoa
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. 167-177 - Roberto Baldacci
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. 178-189 - Eric Prescott-Gagnon, Guy Desaulniers
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. 190-204 - Yuichi Nagata, Olli Bräysy:
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. 205-215 - Enrique Benavent, Angel Corberán, Isaac Plana
Min-Max K-vehicles windy rural postman problem. 216-226 - Sophie N. Parragh
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. 227-242 - Chris Groër, Bruce L. Golden, Edward A. Wasil:
The balanced billing cycle vehicle routing problem. 243-254 - Zhihong Shen, Maged M. Dessouky, Fernando Ordóñez
A two-stage vehicle routing model for large-scale bioterrorism emergencies. 255-269 - Alan L. Erera, Martin W. P. Savelsbergh
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. 270-283
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: