@article{Lee-Lee-Park/13,
AUTHOR = {Lee, Chungmok and Lee, Kyungsik and Park, Sungsoo},
TITLE = {Benders decomposition approach for the robust network design problem with flow bifurcations},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {1-16},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network design, integer programming, benders decomposition, robust optimization},
URL = {http://dx.doi.org/10.1002/net.21486},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Mattia/13,
AUTHOR = {Mattia, Sara},
TITLE = {A polyhedral study of the capacity formulation of the multilayer network design problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {17-26},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {multilayer network design, capacity formulation, facets},
URL = {http://dx.doi.org/10.1002/net.21488},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hunter-Pippenger/13,
AUTHOR = {Hunter, A.H. and Pippenger, Nicholas},
TITLE = {Local versus global search in channel graphs},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {27-34},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {circuit switching, path search, search algorithms},
URL = {http://dx.doi.org/10.1002/net.21489},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Drira-Seba-Effantin-Kheddouci/13,
AUTHOR = {Drira, Kaouther and Seba, Hamida and Effantin, Brice and Kheddouci, Hamamache},
TITLE = {Distance edge coloring and collision-free communication in wireless sensor networks},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {35-47},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {link scheduling, sensor networks, distance edge coloring, grids, hypercubes, power graphs},
URL = {http://dx.doi.org/10.1002/net.21491},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wildstrom/13,
AUTHOR = {Wildstrom, D. Jacob},
TITLE = {Parametrized relocation of low-mobility resources},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {48-55},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {dynamic location, dynamic optimization, min-sum algebra, limited knowledge, competitive ratio},
URL = {http://dx.doi.org/10.1002/net.21492},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sun/13a,
AUTHOR = {Sun, Minghe},
TITLE = {A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {56-71},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network flow algorithms, multiple objective programming, multiple criteria decision making, integer programming, branch-and-bound, network flow problems with side constraints},
URL = {http://dx.doi.org/10.1002/net.21493},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Baston-Kikuta/13,
AUTHOR = {Baston, Vic and Kikuta, Kensaku},
TITLE = {Search games on networks with travelling and search costs and with arbitrary searcher starting points},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {72-79},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {search game on a network, search game with travelling and search costs, search game with immobile hider, search game with searcher choosing his starting point},
URL = {http://dx.doi.org/10.1002/net.21504},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Briskorn-Jaehn/13,
AUTHOR = {Briskorn, Dirk and Jaehn, Florian},
TITLE = {A note on ``Multistage Methods for Freight Train Classification''},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {1},
PAGES = {80-81},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {shunting yard, train classification, minimum feedback arc set problem on euler multigraphs, railway optimization},
URL = {http://dx.doi.org/10.1002/net.21498},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kliemann/13,
AUTHOR = {Kliemann, Lasse},
TITLE = {The price of anarchy in nonatomic consumption-relevance congestion games},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {83-94},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {nonatomic games, nonatomic congestion games, wardrop model, price of anarchy, selfish routing, multicast routing},
URL = {http://dx.doi.org/10.1002/net.21499},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nakano-Uehara-Uno/13,
AUTHOR = {Nakano, Shin-ichi and Uehara, Ryuhei and Uno, Takeaki},
TITLE = {Efficient algorithms for a simple network design problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {95-104},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {approximation algorithm, efficient algorithm, $\mathcal {NP}$-completeness, simple network design, small-world network},
URL = {http://dx.doi.org/10.1002/net.21500},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kluge-Reif-Brokate/13,
AUTHOR = {Kluge, Sebastian and Reif, Konrad and Brokate, Martin},
TITLE = {Computation of the optimal value function in time-dependent networks},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {105-124},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {deterministic network models, shortest path problem, dynamic programming, analysis of algorithms, approximation algorithm},
URL = {http://dx.doi.org/10.1002/net.21501},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Thielen-Westphal/13,
AUTHOR = {Thielen, Clemens and Westphal, Stephan},
TITLE = {Complexity and approximability of the maximum flow problem with minimum quantities},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {125-131},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {maximum flow problem, minimum quantities, computational complexity, approximation algorithms},
URL = {http://dx.doi.org/10.1002/net.21502},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hvattum-Norstad-Fagerholt-Laporte/13,
AUTHOR = {Hvattum, Lars Magnus and Norstad, Inge and Fagerholt, Kjetil and Laporte, Gilbert},
TITLE = {Analysis of an exact algorithm for the vessel speed optimization problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {132-135},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {maritime transportation, fuel emission, scheduling},
URL = {http://dx.doi.org/10.1002/net.21503},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Vaidyanathan/13,
AUTHOR = {Vaidyanathan, Balachandran},
TITLE = {Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {136-148},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {monge matrix, transportation problem, assignment problem, networks flow algorithms, computational complexity, minimum cost flow problem},
URL = {http://dx.doi.org/10.1002/net.21507},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nace-Pioro-Tomaszewski-Zotkiewicz/13,
AUTHOR = {Nace, Dritan and Pi{\'o}ro, Micha{\l} and Tomaszewski, Artur and {\.Z}otkiewicz, Mateusz},
TITLE = {Complexity of a classical flow restoration problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {149-160},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {linear programming, equivalence of separation and optimization, multicommodity flow networks, path generation, survivable network design, $\mathcal {NP}$-hardness},
URL = {http://dx.doi.org/10.1002/net.21508},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Golumbic-Lipshteyn-Stern/13,
AUTHOR = {Golumbic, Martin Charles and Lipshteyn, Marina and Stern, Michal},
TITLE = {Single bend paths on a grid have strong helly number 4: errata atque emendationes ad ``edge intersection graphs of single bend paths on a grid''},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {2},
PAGES = {161-163},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {b1 -epg graphs, intersection graphs, intersecting paths on a grid, strong helly number},
URL = {http://dx.doi.org/10.1002/net.21509},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {Originally in Networks, Vol. 54, 2009, No. 3, 130-138},
}
@article{Dereniowski-Kubiak-Ries-Zwols/13,
AUTHOR = {Dereniowski, Dariusz and Kubiak, Wieslaw and Ries, Bernard and Zwols, Yori},
TITLE = {Optimal edge-coloring with edge rate constraints},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {3},
PAGES = {165-182},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {edge coloring, fractional edge coloring, nearly bipartite graphs, scheduling algorithms, throughput maximization, greedy maximal scheduling, wireless networks},
URL = {http://dx.doi.org/10.1002/net.21505},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Di_Puglia_Pugliese-Guerriero/13,
AUTHOR = {Di Puglia Pugliese, Luigi and Guerriero, Francesca},
TITLE = {A survey of resource constrained shortest path problems: Exact solution approaches},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {3},
PAGES = {183-200},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {shortest path, resource constraints, forbidden path, elementary path},
URL = {http://dx.doi.org/10.1002/net.21511},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Levin-Yovel/13,
AUTHOR = {Levin, Asaf and Yovel, Uri},
TITLE = {Nonoblivious 2-Opt heuristics for the Traveling Salesman Problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {3},
PAGES = {201-219},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {tsp, 2-opt, local search, heuristics, performance guarantees, approximation algorithms},
URL = {http://dx.doi.org/10.1002/net.21512},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cai-Li-Song/13,
AUTHOR = {Cai, Qingqiong and Li, Xueliang and Song, Jiangli},
TITLE = {Solutions to conjectures on the $(k,\ell)$-rainbow index of complete graphs},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {3},
PAGES = {220-224},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {rainbow connectivity, rainbow tree, rainbow index},
URL = {http://dx.doi.org/10.1002/net.21513},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cullenbine-Wood-Newman/13,
AUTHOR = {Cullenbine, Christopher A. and Wood, R. Kevin and Newman, Alexandra M.},
TITLE = {Theoretical and computational advances for network diversion},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {3},
PAGES = {225-242},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network diversion, minimum cut, complexity, mixed-integer programming, valid inequality},
URL = {http://dx.doi.org/10.1002/net.21514},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lejeune-Prasad/13,
AUTHOR = {Lejeune, Miguel A. and Prasad, Srinivas Y.},
TITLE = {Effectiveness-equity models for facility location problems on tree networks},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {243-254},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {facility location, equity, quasiconvexity, multiobjective programming, tree network, efficiency},
URL = {http://dx.doi.org/10.1002/net.21510},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Babonneau-Vial-Klopfenstein-Ouorou/13,
AUTHOR = {Babonneau, F. and Vial, J.-P. and Klopfenstein, O. and Ouorou, A.},
TITLE = {Robust capacity assignment solutions for telecommunications networks with uncertain demands},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {255-272},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {capacity assignment problem, telecommunications networks, robust optimization},
URL = {http://dx.doi.org/10.1002/net.21515},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bodur-Ekim-Taskin/13,
AUTHOR = {Bodur, Merve and Ekim, Tinaz and Ta{\c{s}}kin, Z. Caner},
TITLE = {Decomposition algorithms for solving the minimum weight maximal matching problem},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {273-287},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {minimum maximal matching, vertex cover, mixed integer programming, benders decomposition, gallai-edmonds decomposition},
URL = {http://dx.doi.org/10.1002/net.21516},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Orlin-Vaidyanathan/13,
AUTHOR = {Orlin, James B. and Vaidyanathan, Balachandran},
TITLE = {Fast algorithms for convex cost flow problems on circles, lines, and trees},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {288-296},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network flow algorithms, convex cost flows, minimum cost flows, computational complexity, applications},
URL = {http://dx.doi.org/10.1002/net.21517},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Agra-Andersson-Christiansen-Wolsey/13,
AUTHOR = {Agra, Agostinho and Andersson, Henrik and Christiansen, Marielle and Wolsey, Laurence},
TITLE = {A maritime inventory routing problem: Discrete time formulations and valid inequalities},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {297-314},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {inventory routing, maritime transportation, mixed integer linear formulation, lot-sizing relaxations},
URL = {http://dx.doi.org/10.1002/net.21518},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Boccia-Mannino-Vasilyev/13,
AUTHOR = {Boccia, Maurizio and Mannino, Carlo and Vasilyev, Igor},
TITLE = {The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming},
JOURNAL = {Networks},
VOLUME = {62},
NUMBER = {4},
PAGES = {315-326},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {dispatching problem, mixed integer linear programming},
URL = {http://dx.doi.org/10.1002/net.21528},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Penuel-Smith-Shen/13,
AUTHOR = {Penuel, John and Smith, J. Cole and Shen, Siqian},
TITLE = {Integer programming models and algorithms for the graph decontamination problem with mobile agents},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {1-19},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph decontamination, $\mathcal{NP}$-completeness, integer programming, decomposition, cutting-plane algorithm},
URL = {http://dx.doi.org/10.1002/net.21460},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Balbuena-Garcia-Vazquez-Hansberg-Montejano/13,
AUTHOR = {Balbuena, Camino and Garc{\'{i}}a-V{\'a}zquez, Pedro and Hansberg, Adriana and Montejano, Luis Pedro},
TITLE = {On the super-restricted arc-connectivity of $s$-geodetic digraphs},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {20-28},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {restricted arc-connectivity, arc-cut, diameter, s -geodetic digraph, line digraph},
URL = {http://dx.doi.org/10.1002/net.21462},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Abrego-Fabila-Monroy-Fernandez-Merchant-Flores-Penaloza-Hurtado-Meijer-Sacristan-Saumell/13,
AUTHOR = {{\'A}brego, Bernardo M. and Fabila-Monroy, Ruy and Fern{\'a}ndez-Merchant, Silvia and Flores-Pe{\~n}aloza, David and Hurtado, Ferran and Meijer, Henk and Sacrist{\'a}n, Vera and Saumell, Maria},
TITLE = {Proximity graphs inside large weighted graphs},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {29-39},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {neighborhood, proximity graphs, voronoi diagrams, weighted graphs},
URL = {http://dx.doi.org/10.1002/net.21464},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hochbaum-Orlin/13,
AUTHOR = {Hochbaum, Dorit S. and Orlin, James B.},
TITLE = {Simplifications and speedups of the pseudoflow algorithm},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {40-57},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {maximum flow, minimum cut, pseudoflow algorithm, data structure, dynamic trees},
URL = {http://dx.doi.org/10.1002/net.21467},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Carrabs-Cerulli-Speranza/13,
AUTHOR = {Carrabs, Francesco and Cerulli, Raffaele and Speranza, Maria Grazia},
TITLE = {A branch-and-bound algorithm for the double Travelling Salesman Problem with two stacks},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {58-75},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {double traveling salesman problem, pickup and delivery problems, branch-and-bound, lifo, multiple stacks},
URL = {http://dx.doi.org/10.1002/net.21468},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lopez-de-los-Mozos-Puerto-Rodriguez-Chia/13,
AUTHOR = {L{\'o}pez-de-los-Mozos, M.C. and Puerto, J. and Rodr{\'{i}}guez-Ch{\'{i}}a, A.M.},
TITLE = {Robust mean absolute deviation problems on networks with linear vertex weights},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {1},
PAGES = {76-85},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {location, networks, robust optimization, equality measures},
URL = {http://dx.doi.org/10.1002/net.21471},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Carroll-Fortz-Labbe-McGarraghy/13,
AUTHOR = {Carroll, Paula and Fortz, Bernard and Labb{\'e}, Martine and McGarraghy, Se{\'a}n},
TITLE = {A branch-and-cut algorithm for the ring spur assignment problem},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {89-103},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {survivable network design, np-hardness proof, ip formulation, branch-and-cut algorithm},
URL = {http://dx.doi.org/10.1002/net.21495},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Erdogan-Laporte/13,
AUTHOR = {Erdo{\v{g}}an, G{\"u}ne{\c{s}} and Laporte, Gilbert},
TITLE = {The orienteering problem with variable profits},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {104-116},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {orienteering problem, linearization, integer programming, branch-and-cut},
URL = {http://dx.doi.org/10.1002/net.21496},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hastings-Shier/13,
AUTHOR = {Hastings, K.C. and Shier, D.R.},
TITLE = {Algebraic methods applied to shortest path and maximum flow problems in stochastic networks},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {117-127},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {algebraic, majorization, maximum flow, minimum cut, shortest path, stochastic},
URL = {http://dx.doi.org/10.1002/net.21485},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Koster-Kutschka-Raack/13,
AUTHOR = {Koster, Arie M.C.A. and Kutschka, Manuel and Raack, Christian},
TITLE = {Robust network design: Formulations, valid inequalities, and computations},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {128-149},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network design, robust optimization, polyhedral combinatorics},
URL = {http://dx.doi.org/10.1002/net.21497},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Leitner-Ruthmair-Raidl/13,
AUTHOR = {Leitner, Markus and Ruthmair, Mario and Raidl, G{\"u}nther R.},
TITLE = {Stabilizing branch-and-price for constrained tree problems},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {150-170},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {branch-and-price, integer linear programming, network design, stabilized column generation, steiner tree},
URL = {http://dx.doi.org/10.1002/net.21484},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Mahjoub-Simonetti-Uchoa/13,
AUTHOR = {Mahjoub, A. Ridha and Simonetti, Luidi and Uchoa, Eduardo},
TITLE = {Hop-level flow formulation for the survivable network design with hop constraints problem},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {171-179},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network design, survivability, extended formulations},
URL = {http://dx.doi.org/10.1002/net.21483},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Poss-Raack/13,
AUTHOR = {Poss, Michael and Raack, Christian},
TITLE = {Affine recourse for the robust network design problem: Between static and dynamic routing},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {2},
PAGES = {180-198},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {robust optimization, network design, recourse, affine adjustable robust counterparts, affine routing, demand polytope},
URL = {http://dx.doi.org/10.1002/net.21482},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Coene-Filippi-Spieksma-Stevanato/13,
AUTHOR = {Coene, Sofie and Filippi, Carlo and Spieksma, Frits C.R. and Stevanato, Elisa},
TITLE = {Balancing profits and costs on trees},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {200-211},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {multiobjective combinatorial optimization, trees, traveling salesman problem with profits, kalmanson conditions, complexity},
URL = {http://dx.doi.org/10.1002/net.21469},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Junnila-Laihonen-Parreau/13,
AUTHOR = {Junnila, Ville and Laihonen, Tero and Parreau, Aline},
TITLE = {Tolerant identification with Euclidean balls},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {212-225},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {identifying code, optimal code, sensor network, fault diagnosis},
URL = {http://dx.doi.org/10.1002/net.21472},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Andrews-Anta-Zhang-Zhao/13,
AUTHOR = {Andrews, Matthew and Anta, Antonio Fern{\'a}ndez and Zhang, Lisa and Zhao, Wenbo},
TITLE = {Routing and scheduling for energy and delay minimization in the powerdown model},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {226-237},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {energy, power, routing, scheduling, networks, powerdown model},
URL = {http://dx.doi.org/10.1002/net.21474},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Volz-Brazil-Ras-Swanepoel-Thomas/13,
AUTHOR = {Volz, M.G. and Brazil, M. and Ras, C.J. and Swanepoel, K.J. and Thomas, D.A.},
TITLE = {The Gilbert arborescence problem},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {238-247},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {gilbert network, minimum-cost network, network flows, steiner tree},
URL = {http://dx.doi.org/10.1002/net.21475},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gamst-Pisinger/13,
AUTHOR = {Gamst, Mette and Pisinger, David},
TITLE = {Integrated job scheduling and network routing},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {248-262},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {scheduling, network routing, multicommodity flow, stabilized column generation, dantzig-wolfe decomposition},
URL = {http://dx.doi.org/10.1002/net.21479},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Meddeb/13,
AUTHOR = {Meddeb, Aref},
TITLE = {On building multiple spanning trees and VLAN assignment in metro Ethernet networks},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {3},
PAGES = {263-280},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {metro ethernet, edge disjoint, multiple spanning trees, virtual lan, mapping},
URL = {http://dx.doi.org/10.1002/net.21477},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cheng-Liptak-Yuan/13,
AUTHOR = {Cheng, Eddie and Lipt{\'a}k, L{\'a}szl{\'o} and Yuan, Allen},
TITLE = {Linearly many faults in arrangement graphs},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {4},
PAGES = {281-289},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {connectivity, fault tolerance, arrangement graphs},
URL = {http://dx.doi.org/10.1002/net.21476},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Seth-Klabjan-Ferreira/13,
AUTHOR = {Seth, Anupam and Klabjan, Diego and Ferreira, Placid M.},
TITLE = {Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {4},
PAGES = {290-308},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing, worst-case analysis, printed circuit board, approximation algorithms},
URL = {http://dx.doi.org/10.1002/net.21478},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gouveia-Riera-Ledesma-Salazar-Gonzalez/13,
AUTHOR = {Gouveia, Luis and Riera-Ledesma, Jorge and Salazar-Gonz{\'a}lez, Juan-Jos{\'e}},
TITLE = {Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {4},
PAGES = {309-321},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing, projection, reverse multistar inequalities, cutting plane algorithms},
URL = {http://dx.doi.org/10.1002/net.21481},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ahmed-Lubiw/13,
AUTHOR = {Ahmed, Mustaq and Lubiw, Anna},
TITLE = {Shortest paths avoiding forbidden subpaths},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {4},
PAGES = {322-334},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph algorithm, dijkstra, optical network, road network, exception avoiding path},
URL = {http://dx.doi.org/10.1002/net.21490},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ben-Ameur-Hadji-Ouorou/13,
AUTHOR = {Ben-Ameur, Walid and Hadji, Makhlouf and Ouorou, Adam},
TITLE = {Minimum-weight subgraphs with unicyclic components and a lower-bounded girth},
JOURNAL = {Networks},
VOLUME = {61},
NUMBER = {4},
PAGES = {335-355},
YEAR = {2013},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {combinatorial optimization, network design, polyhedral study, cutting-plane algorithm, unicyclic graphs, matroids},
URL = {http://dx.doi.org/10.1002/net.21487},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}