Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 41
Volume 41, Number 1, January 2003
- Jörg Kalcsics
, Stefan Nickel, Justo Puerto:
Multifacility ordered median problems on networks: A further analysis. 1-12 - Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick:
The SONET edge-partition problem. 13-23 - Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
Upgrading trees under diameter and budget constraints. 24-35 - Robert B. Dial:
Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest-path trees. 36-43 - Shmuel Onn, Elisheva Sperber:
Social network coordination and graph routing. 44-50 - Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza:
Optimal rectangular partitions. 51-67 - Anna Nagurney:
Report: Some recent developments in network economics. 68-72
Volume 41, Number 2, March 2003
- Ján Plesník:
Towards minimum k-geodetically connected graphs. 73-82 - Jean-Claude Bermond, Stéphan Ceroi:
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. 83-86 - Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving resilient capacity for a single commodity with upper-bound constraints. 87-96 - Igor Averbakh, Oded Berman:
An improved algorithm for the minmax regret median problem on a tree. 97-103 - Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP with path-relinking for private virtual circuit routing. 104-114 - J. Scott Provan:
A polynomial-time algorithm to find shortest paths with recourse. 115-125
Volume 41, Number 3, May 2003
- Haldun Süral, James H. Bookbinder:
The single-vehicle routing problem with unrestricted backhauls. 127-136 - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem. 137-142 - Francisco Ortega, Laurence A. Wolsey:
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. 143-158 - Luis Eduardo Neves Gouveia, Thomas L. Magnanti:
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. 159-173 - Ian Frommer, Guruprasad Pundoor:
Small-worlds: A review of recent books. 174-180
Volume 41, Number 4, July 2003
- Mário S. Rosa:
Ernesto de Queirós Vieira Martins (1945-2000): An appreciation. 181-183 - José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Dos Santos:
The determination of the path with minimum-cost norm value. 184-196 - Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà:
Dynamic shortest paths minimizing travel times and costs. 197-205 - João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal:
A bicriterion approach for routing problems in multimedia networks. 206-220 - Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. 221-228 - Domingos Moreira Cardoso, Jorge Freire de Sousa:
A numerical tool for multiattribute ranking problems. 229-234 - Ana Maria de Almeida, Rosália Rodrigues:
Trees, slices, and wheels: On the floorplan area minimization problem. 235-244
a service of 
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 2024-04-19 19:19 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:
