External Links

    Journal: Networks

    Volume 60, Issue 4

    211 -- 0Bruce L. Golden, Douglas R. Shier. Editorial: 2010 Glover-Klingman prize winners
    212 -- 226Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
    227 -- 234Balachandran Vaidyanathan. Simple linear flow decomposition algorithms on trees, circles, and augmented trees
    235 -- 244Emanuele G. Fusco, Andrzej Pelc. Distributed tree comparison with nodes of limited memory
    245 -- 252Lior Kamma, Zeev Nutov. Approximating survivable networks with minimum number of steiner points
    253 -- 258Stefan Ruzika, Markus Thiemann. Min-Max quickest path problems

    Volume 60, Issue 3

    141 -- 154André Rossi, Alok Singh, Marc Sevaux. Column generation algorithm for sensor coverage scheduling under bandwidth constraints
    155 -- 166Maria Teresa Almeida, Filipa D. Carvalho. Integer models and upper bounds for the 3-club problem
    167 -- 178Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell. m and efficient design of reliable networks
    179 -- 193Alf Kimms, Klaus-Christian Maassen. A fast heuristic approach for large-scale cell-transmission-based evacuation route planning
    194 -- 203Richard Cole, Yevgeniy Dodis, Tim Roughgarden. Bottleneck links, variable demand, and the tragedy of the commons
    204 -- 209Domingo Gomez-Perez, Jaime Gutierrez, Álvar Ibeas. Connectedness of finite distance graphs

    Volume 60, Issue 2

    71 -- 85Víctor López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta. A model of self-avoiding random walks for searching complex networks
    86 -- 93Dajin Wang. Constructing optimal subnetworks for the crossed cube network
    94 -- 102Fred R. McMorris, Henry Martyn Mulder, Oscar Ortega. The ℓp-function on trees
    103 -- 119Siqian Shen, J. Cole Smith. Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
    120 -- 131Dmytro Matsypura, Vadim G. Timkovsky. Margining option portfolios by network flows
    132 -- 139Aysegül Altin, Bernard Fortz, Hakan Ümit. Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

    Volume 60, Issue 1

    1 -- 18Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza. k -degree constrained minimum spanning tree problem with node-degree costs
    19 -- 30Jean-François Côté, Michel Gendreau, Jean-Yves Potvin. Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
    31 -- 44Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre. On stackelberg pricing with computationally bounded customers
    45 -- 58Javier Salmerón. Deception tactics for network interdiction: A multiobjective approach
    59 -- 69Toru Hasunuma, Chie Morisaka. Completely independent spanning trees in torus networks
    runs on