@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},
}