@article{Adasme-Lisser-Soto/12,
AUTHOR = {Adasme, Pablo and Lisser, Abdel and Soto, Ismael},
TITLE = {A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {3-12},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {binary quadratically constrained quadratic programming, semidefinite programming, resource allocation, orthogonal frequency division multiple access},
URL = {http://dx.doi.org/10.1002/net.20475},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Imahori-Miyamoto-Hashimoto-Kobayashi-Sasaki-Yagiura/12,
AUTHOR = {Imahori, Shinji and Miyamoto, Yuichiro and Hashimoto, Hideki and Kobayashi, Yusuke and Sasaki, Mihiro and Yagiura, Mutsunori},
TITLE = {The complexity of the node capacitated in-tree packing problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {13-21},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network design, computational complexity, wireless ad hoc network, sensor network},
URL = {http://dx.doi.org/10.1002/net.20476},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bortnikov-Khuller-Li-Mansour-Naor/12,
AUTHOR = {Bortnikov, Edward and Khuller, Samir and Li, Jian and Mansour, Yishay and Naor, Joseph Seffi},
TITLE = {The load-distance balancing problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {22-29},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {approximation algorithms, facility assignment},
URL = {http://dx.doi.org/10.1002/net.20477},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ben-Ameur-Didi_Biha/12,
AUTHOR = {Ben-Ameur, Walid and Didi Biha, Mohamed},
TITLE = {On the minimum cut separator problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {30-36},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph partitioning, cut, vertex separator, polytope},
URL = {http://dx.doi.org/10.1002/net.20478},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Fouilhoux-Karasan-Mahjoub-ozkok-Yaman/12,
AUTHOR = {Fouilhoux, Pierre and Karasan, Oya Ekin and Mahjoub, A. Ridha and {\"o}zk{\"o}k, Onur and Yaman, Hande},
TITLE = {Survivability in hierarchical telecommunications networks},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {37-58},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {hierarchical network, survivability, separation, facet, branch-and-cut, reduction operation},
URL = {http://dx.doi.org/10.1002/net.20479},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Klopfenstein-Nace/12,
AUTHOR = {Klopfenstein, Olivier and Nace, Dritan},
TITLE = {Cover inequalities for robust knapsack sets --- Application to the robust bandwidth packing problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {59-72},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {robust optimization, knapsack set, polyhedral analysis, knapsack cover inequalities, routing, bandwidth packing problem},
URL = {http://dx.doi.org/10.1002/net.20488},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Pukelsheim-Ricca-Simeone-Scozzari-Serafini/12,
AUTHOR = {Pukelsheim, Friedrich and Ricca, Federica and Simeone, Bruno and Scozzari, Andrea and Serafini, Paolo},
TITLE = {Network flow methods for electoral systems},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {73-88},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network flows, electoral systems, biproportional seat apportionment, matrix scaling, political districting, closed lists, give-up},
URL = {http://dx.doi.org/10.1002/net.20480},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ljubic-Putz-Salazar-Gonzalez/12,
AUTHOR = {Ljubi{\'c}, Ivana and Putz, Peter and Salazar-Gonz{\'a}lez, Juan-Jos{\'e}},
TITLE = {Exact approaches to the single-source network loading problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {89-106},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {local access network design, network loading, capacitated network design, benders decomposition},
URL = {http://dx.doi.org/10.1002/net.20481},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kosuch-Le_Bodic-Leung-Lisser/12,
AUTHOR = {Kosuch, Stefanie and Le Bodic, Pierre and Leung, Janny and Lisser, Abdel},
TITLE = {On a stochastic bilevel programming problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {107-116},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {bilevel, stochastic, optimization, networks, pricing},
URL = {http://dx.doi.org/10.1002/net.20482},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Castro-Cuesta/12,
AUTHOR = {Castro, Jordi and Cuesta, Jordi},
TITLE = {Improving an interior-point algorithm for multicommodity flows by quadratic regularizations},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {117-131},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interior-point methods, multicommodity network flows, preconditioned conjugate gradient, regularizations, large-scale computational optimization},
URL = {http://dx.doi.org/10.1002/net.20483},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Orlowski-Pioro/12,
AUTHOR = {Orlowski, Sebastian and Pi{\'o}ro, Micha{\l}},
TITLE = {Complexity of column generation in network design with path-based survivability mechanisms},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {132-147},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {computational complexity, mixed-integer programing, column/path generation, survivable network design},
URL = {http://dx.doi.org/10.1002/net.20484},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Uchoa-Toffolo-de_Souza-Martins-Fukasawa/12,
AUTHOR = {Uchoa, Eduardo and Toffolo, T{\'u}lio A.M. and de Souza, Mauricio C. and Martins, Alexandre X. and Fukasawa, Ricardo},
TITLE = {Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {148-160},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {network design, branch-and-cut, fenchel cuts, mip based local search},
URL = {http://dx.doi.org/10.1002/net.20485},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Addis-Carello-Ceselli/12,
AUTHOR = {Addis, Bernardetta and Carello, Giuliana and Ceselli, Alberto},
TITLE = {Exactly solving a two-level location problem with modular node capacities},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {161-180},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {location, discretization, column generation, branch-and-price, telecommunications},
URL = {http://dx.doi.org/10.1002/net.20486},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Busing/12,
AUTHOR = {B{\"u}sing, Christina},
TITLE = {Recoverable robust shortest path problems},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {1},
PAGES = {181-189},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {uncertainties, robustness, recovery, shortest path problem, np-hardness, approximation},
URL = {http://dx.doi.org/10.1002/net.20487},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Serafini-Simeone/12,
AUTHOR = {Serafini, Paolo and Simeone, Bruno},
TITLE = {Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {191-208},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {electoral systems, biproportional apportionment, parametric maximum flow, min-max optimization, lexicographic optimization},
URL = {http://dx.doi.org/10.1002/net.20434},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nagarajan-Ravi/12,
AUTHOR = {Nagarajan, Viswanath and Ravi, R.},
TITLE = {Approximation algorithms for distance constrained vehicle routing problems},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {209-214},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {vehicle routing, traveling salesman problem, approximation algorithms},
URL = {http://dx.doi.org/10.1002/net.20435},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Skorin-Kapov-Skorin-Kapov/12,
AUTHOR = {Skorin-Kapov, Darko and Skorin-Kapov, Jadranka},
TITLE = {A note on Steiner tree games},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {215-225},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {communication network, cost allocation, cooperative games, mathematical programming, steiner trees},
URL = {http://dx.doi.org/10.1002/net.20436},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Thiongane/12,
AUTHOR = {Thiongane, Babacar},
TITLE = {Lagrangean decomposition/relaxation for the routing and wavelength assignment problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {226-239},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {routing and wavelength assignment problem, shortest path problem, knapsack problem, lagrangean relaxation, lagrangean decomposition, subgradient method},
URL = {http://dx.doi.org/10.1002/net.20437},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nannicini-Delling-Schultes-Liberti/12,
AUTHOR = {Nannicini, Giacomo and Delling, Daniel and Schultes, Dominik and Liberti, Leo},
TITLE = {Bidirectional $A^{\ast}$ search on time-dependent road networks},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {240-251},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {shortest paths, time-dependent networks, road networks, goal directed search},
URL = {http://dx.doi.org/10.1002/net.20438},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Meyers-Schulz/12,
AUTHOR = {Meyers, Carol A. and Schulz, Andreas S.},
TITLE = {The complexity of welfare maximization in congestion games},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {252-260},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {congestion games, network optimization, multicommodity flows, computational complexity},
URL = {http://dx.doi.org/10.1002/net.20439},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Daugulis/12,
AUTHOR = {Daugulis, Peteris},
TITLE = {A note on a generalization of eigenvector centrality for bipartite graphs and applications},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {2},
PAGES = {261-264},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {eigenvector, eigenvector centrality, weighted bipartite graph, positive weight relation (pwr), normed eigenvector centrality sequence (necs), normed eigenvector bicentrality sequence (nebs)},
URL = {http://dx.doi.org/10.1002/net.20442},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Angelini-Di_Battista-Frati/12,
AUTHOR = {Angelini, Patrizio and Di Battista, Giuseppe and Frati, Fabrizio},
TITLE = {Succinct greedy drawings do not always exist},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {267-274},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph drawing, greedy drawing, exponential area, proximity drawings},
URL = {http://dx.doi.org/10.1002/net.21449},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ausiello-Firmani-Laura/12,
AUTHOR = {Ausiello, Giorgio and Firmani, Donatella and Laura, and Luigi},
TITLE = {Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {275-288},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {graph connectivity, streaming computation, articulation points, bridges, biconnected components},
URL = {http://dx.doi.org/10.1002/net.21450},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Clementi-Monti-Pasquale-Silvestri/12,
AUTHOR = {Clementi, Andrea and Monti, Angelo and Pasquale, Francesco and Silvestri, Riccardo},
TITLE = {Optimal gossiping in geometric radio networks in the presence of dynamical faults},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {289-298},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {ad-hoc radio networks, fault-tolerant protocols, gossiping, distributed protocols},
URL = {http://dx.doi.org/10.1002/net.21451},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Das-Ghidini-Navarra-Pinotti/12,
AUTHOR = {Das, Sajal K. and Ghidini, Giacomo and Navarra, Alfredo and Pinotti, Cristina M.},
TITLE = {Localization and scheduling protocols for actor-centric sensor networks},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {299-319},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {wireless sensor and actor networks, sleep-awake schedules, localization protocols, distributed protocols, stochastic analysis, optimal node coloring},
URL = {http://dx.doi.org/10.1002/net.21454},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Greenlaw-Kantabutra-Longani/12,
AUTHOR = {Greenlaw, Raymond and Kantabutra, Sanpawat and Longani, Pattama},
TITLE = {A mobility model for studying wireless communication and the complexity of problems in the model},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {320-330},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {wireless mobile communications, ad hoc networks, complexity},
URL = {http://dx.doi.org/10.1002/net.21452},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Pelc/12,
AUTHOR = {Pelc, Andrzej},
TITLE = {Deterministic rendezvous in networks: A comprehensive survey},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {3},
PAGES = {331-347},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {mobile agent, rendezvous, deterministic, network, graph},
URL = {http://dx.doi.org/10.1002/net.21453},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cheng-Hu-Jia-Liptak/12,
AUTHOR = {Cheng, Eddie and Hu, Philip and Jia, Roger and Lipt{\'a}k, L{\'a}szl{\'o}},
TITLE = {Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {349-356},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interconnection networks, perfect matching, bipartite graphs},
URL = {http://dx.doi.org/10.1002/net.20440},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cheng-Hu-Jia-Liptak/12a,
AUTHOR = {Cheng, Eddie and Hu, Philip and Jia, Roger and Lipt{\'a}k, L{\'a}szl{\'o}},
TITLE = {Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {357-364},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {interconnection networks, perfect matching, cayley graphs, hyper-stars},
URL = {http://dx.doi.org/10.1002/net.20441},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gamvros-Gouveia-Raghavan/12,
AUTHOR = {Gamvros, Ioannis and Gouveia, Luis and Raghavan, S.},
TITLE = {Reload cost trees and network design},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {365-379},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {reload costs, network design, integer programming formulations, spanning trees, steiner variants, diameter/hop constraints},
URL = {http://dx.doi.org/10.1002/net.20443},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Feldmann-Roglin-Vocking/12,
AUTHOR = {Feldmann, Andreas Emil and R{\"o}glin, Heiko and V{\"o}cking, Berthold},
TITLE = {Computing approximate Nash equilibria in network congestion games},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {380-386},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {algorithmic game theory, approximate nash equilibria, congestion games},
URL = {http://dx.doi.org/10.1002/net.20444},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bordenave-Gendreau-Laporte/12,
AUTHOR = {Bordenave, Charles and Gendreau, Michel and Laporte, G.},
TITLE = {A branch-and-cut algorithm for the preemptive swapping problem},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {387-399},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {swapping problem, vehicle routing, branch-and-cut, precedence relationships},
URL = {http://dx.doi.org/10.1002/net.20447},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Altner-Brooks/12,
AUTHOR = {Altner, Douglas S. and Brooks, J. Paul},
TITLE = {Coverings and matchings in $r$-partite hypergraphs},
JOURNAL = {Networks},
VOLUME = {59},
NUMBER = {4},
PAGES = {400-410},
YEAR = {2012},
EDITOR = {Golden, Bruce L. and Shier, Douglas R.},
KEYWORDS = {covering, matching, ryser's conjecture, r -partite hypergraphs, intersecting hypergraphs},
URL = {http://dx.doi.org/10.1002/net.20459},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}