External Links

    Journal: Networks

    Volume 62, Issue 4

    243 -- 254Miguel A. Lejeune, Srinivas Y. Prasad. Effectiveness-equity models for facility location problems on tree networks
    255 -- 272Frédéric Babonneau, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou. Robust capacity assignment solutions for telecommunications networks with uncertain demands
    273 -- 287Merve Bodur, Tinaz Ekim, Z. Caner Taskin. Decomposition algorithms for solving the minimum weight maximal matching problem
    288 -- 296James B. Orlin, Balachandran Vaidyanathan. Fast algorithms for convex cost flow problems on circles, lines, and trees
    297 -- 314Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey. A maritime inventory routing problem: Discrete time formulations and valid inequalities
    315 -- 326Maurizio Boccia, Carlo Mannino, Igor Vasilyev. The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming

    Volume 62, Issue 3

    165 -- 182Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols. Optimal edge-coloring with edge rate constraints
    183 -- 200Luigi Di Puglia Pugliese, Francesca Guerriero. A survey of resource constrained shortest path problems: Exact solution approaches
    201 -- 219Asaf Levin, Uri Yovel. Nonoblivious 2-Opt heuristics for the traveling salesman problem
    220 -- 224Qingqiong Cai, Xueliang Li, Jiangli Song. k, ℓ)-rainbow index of complete graphs
    225 -- 242Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman. Theoretical and computational advances for network diversion

    Volume 62, Issue 2

    83 -- 94Lasse Kliemann. The price of anarchy in nonatomic consumption-relevance congestion games
    95 -- 104Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno. Efficient algorithms for a simple network design problem
    105 -- 124Sebastian Kluge, Konrad Reif, Martin Brokate. Computation of the optimal value function in time-dependent networks
    125 -- 131Clemens Thielen, Stephan Westphal. Complexity and approximability of the maximum flow problem with minimum quantities
    132 -- 135Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte. Analysis of an exact algorithm for the vessel speed optimization problem
    136 -- 148Balachandran Vaidyanathan. Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs
    149 -- 160Dritan Nace, Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz. Complexity of a classical flow restoration problem
    161 -- 163Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. errata atque emendationes ad "edge intersection graphs of single bend paths on a grid"

    Volume 62, Issue 1

    1 -- 16Chungmok Lee, Kyungsik Lee, Sungsoo Park. Benders decomposition approach for the robust network design problem with flow bifurcations
    17 -- 26Sara Mattia. A polyhedral study of the capacity formulation of the multilayer network design problem
    27 -- 34A. H. Hunter, Nicholas Pippenger. Local versus global search in channel graphs
    35 -- 47Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci. Distance edge coloring and collision-free communication in wireless sensor networks
    48 -- 55D. Jacob Wildstrom. Parametrized relocation of low-mobility resources
    56 -- 71Minghe Sun. A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
    72 -- 79Vic Baston, Kensaku Kikuta. Search games on networks with travelling and search costs and with arbitrary searcher starting points
    80 -- 81Dirk Briskorn, Florian Jaehn. A note on "Multistage Methods for Freight Train Classification"
    runs on