Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks41.bht:"
download as .bib file
@article{DBLP:journals/networks/AhujaOPS03,
author = {Ravindra K. Ahuja and
James B. Orlin and
Stefano Pallottino and
Maria Grazia Scutell{\`{a}}},
title = {Dynamic shortest paths minimizing travel times and costs},
journal = {Networks},
volume = {41},
number = {4},
pages = {197--205},
year = {2003},
url = {https://doi.org/10.1002/net.10072},
doi = {10.1002/NET.10072},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhujaOPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AlmeidaR03,
author = {Ana Maria de Almeida and
Ros{\'{a}}lia Rodrigues},
title = {Trees, slices, and wheels: On the floorplan area minimization problem},
journal = {Networks},
volume = {41},
number = {4},
pages = {235--244},
year = {2003},
url = {https://doi.org/10.1002/net.10075},
doi = {10.1002/NET.10075},
timestamp = {Wed, 30 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AlmeidaR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AverbakhB03,
author = {Igor Averbakh and
Oded Berman},
title = {An improved algorithm for the minmax regret median problem on a tree},
journal = {Networks},
volume = {41},
number = {2},
pages = {97--103},
year = {2003},
url = {https://doi.org/10.1002/net.10062},
doi = {10.1002/NET.10062},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AverbakhB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermondC03,
author = {Jean{-}Claude Bermond and
St{\'{e}}phan Ceroi},
title = {Minimizing {SONET} ADMs in unidirectional {WDM} rings with grooming
ratio 3},
journal = {Networks},
volume = {41},
number = {2},
pages = {83--86},
year = {2003},
url = {https://doi.org/10.1002/net.10061},
doi = {10.1002/NET.10061},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermondC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrightwellOS03,
author = {Graham R. Brightwell and
Gianpaolo Oriolo and
F. Bruce Shepherd},
title = {Reserving resilient capacity for a single commodity with upper-bound
constraints},
journal = {Networks},
volume = {41},
number = {2},
pages = {87--96},
year = {2003},
url = {https://doi.org/10.1002/net.10064},
doi = {10.1002/NET.10064},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrightwellOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CalheirosLS03,
author = {Felipe C. Calheiros and
Abilio Lucena and
Cid C. de Souza},
title = {Optimal rectangular partitions},
journal = {Networks},
volume = {41},
number = {1},
pages = {51--67},
year = {2003},
url = {https://doi.org/10.1002/net.10058},
doi = {10.1002/NET.10058},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CalheirosLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CardosoS03,
author = {Domingos Moreira Cardoso and
Jorge Freire de Sousa},
title = {A numerical tool for multiattribute ranking problems},
journal = {Networks},
volume = {41},
number = {4},
pages = {229--234},
year = {2003},
url = {https://doi.org/10.1002/net.10074},
doi = {10.1002/NET.10074},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CardosoS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChepoiNV03,
author = {Victor Chepoi and
Hartmut Noltemeier and
Yann Vax{\`{e}}s},
title = {Upgrading trees under diameter and budget constraints},
journal = {Networks},
volume = {41},
number = {1},
pages = {24--35},
year = {2003},
url = {https://doi.org/10.1002/net.10055},
doi = {10.1002/NET.10055},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChepoiNV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ClimacoCP03,
author = {Jo{\~{a}}o C. N. Cl{\'{\i}}maco and
Jos{\'{e}} M. F. Craveirinha and
Marta M. B. Pascoal},
title = {A bicriterion approach for routing problems in multimedia networks},
journal = {Networks},
volume = {41},
number = {4},
pages = {206--220},
year = {2003},
url = {https://doi.org/10.1002/net.10073},
doi = {10.1002/NET.10073},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ClimacoCP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Dial03,
author = {Robert B. Dial},
title = {Toward faster algorithms for dynamic traffic assignment. I. Parametric
quickest-path trees},
journal = {Networks},
volume = {41},
number = {1},
pages = {36--43},
year = {2003},
url = {https://doi.org/10.1002/net.10056},
doi = {10.1002/NET.10056},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Dial03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FontesHC03,
author = {Dalila B. M. M. Fontes and
Eleni Hadjiconstantinou and
Nicos Christofides},
title = {Upper bounds for single-source uncapacitated concave minimum-cost
network flow problems},
journal = {Networks},
volume = {41},
number = {4},
pages = {221--228},
year = {2003},
url = {https://doi.org/10.1002/net.10076},
doi = {10.1002/NET.10076},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/FontesHC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Fremuth-PaegerJ03,
author = {Christian Fremuth{-}Paeger and
Dieter Jungnickel},
title = {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},
journal = {Networks},
volume = {41},
number = {3},
pages = {137--142},
year = {2003},
url = {https://doi.org/10.1002/net.10066},
doi = {10.1002/NET.10066},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Fremuth-PaegerJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FrommerP03,
author = {Ian Frommer and
Guruprasad Pundoor},
title = {Small-worlds: {A} review of recent books},
journal = {Networks},
volume = {41},
number = {3},
pages = {174--180},
year = {2003},
url = {https://doi.org/10.1002/net.10059},
doi = {10.1002/NET.10059},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FrommerP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldschmidtHLO03,
author = {Olivier Goldschmidt and
Dorit S. Hochbaum and
Asaf Levin and
Eli V. Olinick},
title = {The {SONET} edge-partition problem},
journal = {Networks},
volume = {41},
number = {1},
pages = {13--23},
year = {2003},
url = {https://doi.org/10.1002/net.10054},
doi = {10.1002/NET.10054},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldschmidtHLO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GouveiaM03,
author = {Luis Eduardo Neves Gouveia and
Thomas L. Magnanti},
title = {Network flow models for designing diameter-constrained minimum-spanning
and Steiner trees},
journal = {Networks},
volume = {41},
number = {3},
pages = {159--173},
year = {2003},
url = {https://doi.org/10.1002/net.10069},
doi = {10.1002/NET.10069},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GouveiaM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KalcsicsNP03,
author = {J{\"{o}}rg Kalcsics and
Stefan Nickel and
Justo Puerto},
title = {Multifacility ordered median problems on networks: {A} further analysis},
journal = {Networks},
volume = {41},
number = {1},
pages = {1--12},
year = {2003},
url = {https://doi.org/10.1002/net.10053},
doi = {10.1002/NET.10053},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KalcsicsNP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Nagurney03,
author = {Anna Nagurney},
title = {Report: Some recent developments in network economics},
journal = {Networks},
volume = {41},
number = {1},
pages = {68--72},
year = {2003},
url = {https://doi.org/10.1002/net.10052},
doi = {10.1002/NET.10052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Nagurney03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OnnS03,
author = {Shmuel Onn and
Elisheva Sperber},
title = {Social network coordination and graph routing},
journal = {Networks},
volume = {41},
number = {1},
pages = {44--50},
year = {2003},
url = {https://doi.org/10.1002/net.10057},
doi = {10.1002/NET.10057},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OnnS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrtegaW03,
author = {Francisco Ortega and
Laurence A. Wolsey},
title = {A branch-and-cut algorithm for the single-commodity, uncapacitated,
fixed-charge network flow problem},
journal = {Networks},
volume = {41},
number = {3},
pages = {143--158},
year = {2003},
url = {https://doi.org/10.1002/net.10068},
doi = {10.1002/NET.10068},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrtegaW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PaixaoMRS03,
author = {Jos{\'{e}} M. P. Paix{\~{a}}o and
Ernesto de Queir{\'{o}}s Vieira Martins and
M{\'{a}}rio S. Rosa and
Jos{\'{e}} Luis E. Dos Santos},
title = {The determination of the path with minimum-cost norm value},
journal = {Networks},
volume = {41},
number = {4},
pages = {184--196},
year = {2003},
url = {https://doi.org/10.1002/net.10077},
doi = {10.1002/NET.10077},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PaixaoMRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Plesnik03,
author = {J{\'{a}}n Plesn{\'{\i}}k},
title = {Towards minimum k-geodetically connected graphs},
journal = {Networks},
volume = {41},
number = {2},
pages = {73--82},
year = {2003},
url = {https://doi.org/10.1002/net.10060},
doi = {10.1002/NET.10060},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Plesnik03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Provan03,
author = {J. Scott Provan},
title = {A polynomial-time algorithm to find shortest paths with recourse},
journal = {Networks},
volume = {41},
number = {2},
pages = {115--125},
year = {2003},
url = {https://doi.org/10.1002/net.10063},
doi = {10.1002/NET.10063},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Provan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ResendeR03,
author = {Mauricio G. C. Resende and
Celso C. Ribeiro},
title = {A {GRASP} with path-relinking for private virtual circuit routing},
journal = {Networks},
volume = {41},
number = {2},
pages = {104--114},
year = {2003},
url = {https://doi.org/10.1002/net.10065},
doi = {10.1002/NET.10065},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ResendeR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rosa03,
author = {M{\'{a}}rio S. Rosa},
title = {Ernesto de Queir{\'{o}}s Vieira Martins {(1945-2000):} An appreciation},
journal = {Networks},
volume = {41},
number = {4},
pages = {181--183},
year = {2003},
url = {https://doi.org/10.1002/net.10071},
doi = {10.1002/NET.10071},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rosa03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SuralB03,
author = {Haldun S{\"{u}}ral and
James H. Bookbinder},
title = {The single-vehicle routing problem with unrestricted backhauls},
journal = {Networks},
volume = {41},
number = {3},
pages = {127--136},
year = {2003},
url = {https://doi.org/10.1002/net.10067},
doi = {10.1002/NET.10067},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SuralB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-07-11 08:09 CEST from data curated 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:
