default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 60
Volume 60, Number 1, August 2012
- Christophe Duhamel
, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. 1-18 - Jean-François Côté, Michel Gendreau, Jean-Yves Potvin:
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. 19-30 - Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre:
On stackelberg pricing with computationally bounded customers. 31-44 - Javier Salmerón:
Deception tactics for network interdiction: A multiobjective approach. 45-58 - Toru Hasunuma, Chie Morisaka:
Completely independent spanning trees in torus networks. 59-69
Volume 60, Number 2, September 2012
- Víctor López Millán, Vicent Cholvi, Luis López, Antonio Fernández Anta:
A model of self-avoiding random walks for searching complex networks. 71-85 - Dajin Wang:
Constructing optimal subnetworks for the crossed cube network. 86-93 - Fred R. McMorris, Henry Martyn Mulder, Oscar Ortega:
The ℓp-function on trees. 94-102 - Siqian Shen, J. Cole Smith:
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. 103-119 - Dmytro Matsypura, Vadim G. Timkovsky:
Margining option portfolios by network flows. 120-131 - Aysegül Altin, Bernard Fortz, Hakan Ümit:
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. 132-139
Volume 60, Number 3, October 2012
- André Rossi, Alok Singh, Marc Sevaux:
Column generation algorithm for sensor coverage scheduling under bandwidth constraints. 141-154 - Maria Teresa Almeida, Filipa D. Carvalho:
Integer models and upper bounds for the 3-club problem. 155-166 - Ralph J. Faudree, Ronald J. Gould, Jeffrey S. Powell:
Property Pd, m and efficient design of reliable networks. 167-178 - Alf Kimms, Klaus-Christian Maassen:
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning. 179-193 - Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
Bottleneck links, variable demand, and the tragedy of the commons. 194-203 - Domingo Gómez-Pérez, Jaime Gutierrez, Álvar Ibeas:
Connectedness of finite distance graphs. 204-209
Volume 60, Number 4, December 2012
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2010 Glover-Klingman prize winners. 211 - Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. 212-226 - Balachandran Vaidyanathan:
Simple linear flow decomposition algorithms on trees, circles, and augmented trees. 227-234 - Emanuele G. Fusco, Andrzej Pelc:
Distributed tree comparison with nodes of limited memory. 235-244 - Lior Kamma, Zeev Nutov:
Approximating survivable networks with minimum number of steiner points. 245-252 - Stefan Ruzika, Markus Thiemann:
Min-Max quickest path problems. 253-258
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 2026-05-29 23:53 CEST 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:
