default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 61
Volume 61, Number 1, January 2013
- John Penuel
, J. Cole Smith, Siqian Shen:
Integer programming models and algorithms for the graph decontamination problem with mobile agents. 1-19 - Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
On the super-restricted arc-connectivity of s -geodetic digraphs. 20-28 - Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell:
Proximity graphs inside large weighted graphs. 29-39 - Dorit S. Hochbaum, James B. Orlin:
Simplifications and speedups of the pseudoflow algorithm. 40-57 - Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza:
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. 58-75 - Maria Cruz López de los Mozos Martin, Justo Puerto, Antonio M. Rodríguez-Chía:
Robust mean absolute deviation problems on networks with linear vertex weights. 76-85
Volume 61, Number 2, March 2013
- Luis Eduardo Neves Gouveia, Stefan Voß:
Editorial. 87-88 - Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
A branch-and-cut algorithm for the ring spur assignment problem. 89-103 - Günes Erdogan, Gilbert Laporte:
The orienteering problem with variable profits. 104-116 - Katherine C. Hastings, Douglas R. Shier:
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks. 117-127 - Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Robust network design: Formulations, valid inequalities, and computations. 128-149 - Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. 150-170 - Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-level flow formulation for the survivable network design with hop constraints problem. 171-179 - Michael Poss, Christian Raack:
Affine recourse for the robust network design problem: Between static and dynamic routing. 180-198
Volume 61, Number 3, May 2013
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2011 Glover-Klingman Prize Winners. 199 - Sofie Coene, Carlo Filippi, Frits C. R. Spieksma, Elisa Stevanato:
Balancing profits and costs on trees. 200-211 - Ville Junnila, Tero Laihonen, Aline Parreau:
Tolerant identification with Euclidean balls. 212-225 - Matthew Andrews, Antonio Fernández Anta, Lisa Zhang, Wenbo Zhao:
Routing and scheduling for energy and delay minimization in the powerdown model. 226-237 - M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
The Gilbert arborescence problem. 238-247 - Mette Gamst, David Pisinger:
Integrated job scheduling and network routing. 248-262 - Aref Meddeb:
On building multiple spanning trees and VLAN assignment in metro ethernet networks. 263-280
Volume 61, Number 4, July 2013
- Eddie Cheng, László Lipták, Allen Yuan:
Linearly many faults in arrangement graphs. 281-289 - Anupam Seth, Diego Klabjan, Placid M. Ferreira:
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems. 290-308 - Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González:
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. 309-321 - Mustaq Ahmed, Anna Lubiw:
Shortest paths avoiding forbidden subpaths. 322-334 - Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. 335-355
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-24 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
