default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 50
Volume 50, Number 1, August 2007
- Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Preface. 1-2 - Filipe Pereira Alvelos
, José M. Valério de Carvalho:
An extended model and a column generation algorithm for the planar multicommodity flow problem. 3-16 - Alper Atamtürk, Oktay Günlük:
Network design arc set with variable upper bounds. 17-28 - Andreas Bley:
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. 29-36 - Mustapha Bouhtou, Guillaume Erbs, Michel Minoux:
Joint optimization of pricing and resource allocation in competitive telecommunications networks. 37-49 - Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà:
Hardness of robust network design. 50-54 - Alexandre Salles da Cunha, Abilio Lucena:
Lower and upper bounds for the degree-constrained minimum spanning tree problem. 55-66 - Dalila B. M. M. Fontes, José Fernando Gonçalves:
Heuristic solutions for general concave minimum cost network flow problems. 67-76 - Jeff Hartline, Alexa Sharp:
Incremental flow. 77-85 - Hovhannes A. Harutyunyan, Calin D. Morosan:
On the minimum path problem in Knödel graphs. 86-91 - Gilbert Laporte, Inmaculada Rodríguez Martín:
Locating a cycle in a transportation or a telecommunications network. 92-108 - Benoit Lardeux, Dritan Nace, Jérôme Geffard:
Multiperiod network design with incremental routing. 109-117 - Guang Xu, Yang Yang, Jinhui Xu:
Linear time algorithms for approximating the facility terminal cover problem. 118-126
Volume 50, Number 2, September 2007
- Oded Berman, Jiamin Wang:
The 1-minimax and 1-maximin problems with demand weights of general probability distributions. 127-135 - Fernando Ordóñez, Jiamin Zhao:
Robust capacity expansion of network flows. 136-145 - Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Panpositionable hamiltonicity of the alternating group graphs. 146-156 - Ning Shi, Raymond K. Cheung, Haiqing Song:
On stochastic programs over trees with partially dependent arc capacities. 157-163 - Toni R. Farley, Charles J. Colbourn:
Multiterminal resilience for series-parallel networks. 164-172 - Eddie Cheng, László Lipták:
Matching preclusion for some interconnection networks. 173-180
Volume 50, Number 3, October 2007
- Donglei Du, R. Chandrasekaran:
The maximum residual flow problem: NP-hardness with two-arc destruction. 181-182 - Karen R. Smilowitz, Carlos F. Daganzo:
Continuum approximation techniques for the design of integrated package distribution systems. 183-196 - Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
Some results about f-critical graphs. 197-202 - B. S. Panda, Anita Das:
On tree 3-spanners in directed path graphs. 203-210 - Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstein:
The vehicle rescheduling problem: Model and algorithms. 211-229
Volume 50, Number 4, December 2007
- Katerina Asdre, Stavros D. Nikolopoulos:
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. 231-240 - José Gómez:
Large vertex symmetric digraphs. 241-250 - Geir Dahl:
Majorization and distances in trees. 251-257 - Hipólito Hernández-Pérez, Juan José Salazar González:
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. 258-272 - Sung-Pil Hong, Byung-Cheon Choi:
Approximability of the k-server disconnection problem. 273-282
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-15 23:33 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:
