External Links

    Journal: Networks

    Volume 81, Issue 4

    419 -- 444Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas. Network augmentation for disaster-resilience against geographically correlated failure
    445 -- 464Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins. A combinatorial branch and bound for the safe set problem
    465 -- 489M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan. Maximum weight perfect matching problem with additional disjunctive conflict constraints
    490 -- 498Christina Graves. More reliable graphs are not always stronger
    499 -- 513Nicola Bianchessi. On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm

    Volume 81, Issue 3

    319 -- 333Alejandra Casado, Nenad Mladenovic, Jesús Sánchez-Oro, Abraham Duarte. Variable neighborhood search approach with intensified shake for monitor placement
    334 -- 358Di H. Nguyen, Yongjia Song, J. Cole Smith. A two-stage network interdiction-monitoring game
    359 -- 377Pouria Arsalani, Mohammad Reisi-Nafchi, Vahid Dardashti, Ghasem Moslehi. Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem
    378 -- 398Can Gokalp, Stephen D. Boyles, Avinash Unnikrishnan. Mean-standard deviation model for minimum cost flow problem
    399 -- 416Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa. Solving vehicle routing problems with intermediate stops using VRPSolver models

    Volume 81, Issue 2

    155 -- 176Haochen Luo, Kiavash Kianfar. Valid inequalities and facets for multi-module survivable network design problem
    177 -- 203Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot. Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
    204 -- 219Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore. The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
    220 -- 234Hanoch Lev-Ari, Yariv Ephraim, Brian L. Mark. Traffic rate network tomography with higher-order cumulants
    235 -- 252Alberto Santini, Claudia Archetti. The hazardous orienteering problem
    253 -- 277Ralf Borndörfer, Stephan Schwartz, William Surau. Vertex covering with capacitated trees
    278 -- 293François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès. Optimizing the ecological connectivity of landscapes
    294 -- 315Mercedes Landete, Juanjo Peiró, Hande Yaman. Formulations and valid inequalities for the capacitated dispersion problem

    Volume 81, Issue 1

    3 -- 22Sumin Kang, Manish Bansal. Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set
    23 -- 50Antoine Oustry, Marion Le Tilly, Thomas Heide Clausen, Claudia D'Ambrosio, Leo Liberti. Optimal deployment of indoor wireless local area networks
    51 -- 74Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider. EETTlib - Energy-efficient train timetabling library
    75 -- 92Robert Benkoczi, Oluwaseun F. Lijoka. Capacity provisioning for evacuation on path networks
    93 -- 106Burak Boyaci, Thu Huong Dang, Adam N. Letchford. Improving a constructive heuristic for the general routing problem
    107 -- 124Burak Boyaci, Thu Huong Dang, Adam N. Letchford. Fast upper and lower bounds for a large-scale real-world arc routing problem
    125 -- 151Zacharie Alès, Sourour Elloumi. Minimizing recovery cost of network optimization problems
    runs on