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/networks9.bht:"
download as .bib file
@article{DBLP:journals/networks/Balachandran79,
author = {V. Balachandran},
title = {Generalized transportation networks with stochastic demands: An operator
theoretic approach},
journal = {Networks},
volume = {9},
number = {2},
pages = {169--184},
year = {1979},
url = {https://doi.org/10.1002/net.3230090205},
doi = {10.1002/NET.3230090205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Balachandran79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CameriniFM79,
author = {Paolo M. Camerini and
Luigi Fratta and
Francesco Maffioli},
title = {A note on finding optimum branchings},
journal = {Networks},
volume = {9},
number = {4},
pages = {309--312},
year = {1979},
url = {https://doi.org/10.1002/net.3230090403},
doi = {10.1002/NET.3230090403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CameriniFM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChungH79,
author = {F. R. K. Chung and
Frank K. Hwang},
title = {The largest minimal rectilinear steiner trees for a set of \emph{n}
points enclosed in a rectangle with given perimeter},
journal = {Networks},
volume = {9},
number = {1},
pages = {19--36},
year = {1979},
url = {https://doi.org/10.1002/net.3230090103},
doi = {10.1002/NET.3230090103},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChungH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DialGKK79,
author = {R. Dial and
Fred W. Glover and
David Karney and
Darwin Klingman},
title = {A computational analysis of alternative algorithms and labeling techniques
for finding shortest path trees},
journal = {Networks},
volume = {9},
number = {3},
pages = {215--248},
year = {1979},
url = {https://doi.org/10.1002/net.3230090304},
doi = {10.1002/NET.3230090304},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DialGKK79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DionneF79,
author = {R. Dionne and
Michael Florian},
title = {Exact and approximate algorithms for optimal network design},
journal = {Networks},
volume = {9},
number = {1},
pages = {37--59},
year = {1979},
url = {https://doi.org/10.1002/net.3230090104},
doi = {10.1002/NET.3230090104},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DionneF79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Farley79,
author = {Asthur M. Farley},
title = {Minimal broadcast networks},
journal = {Networks},
volume = {9},
number = {4},
pages = {313--332},
year = {1979},
url = {https://doi.org/10.1002/net.3230090404},
doi = {10.1002/NET.3230090404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Farley79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GalloS79,
author = {G. Gallo and
C. Sodini},
title = {Adjacent extreme flows and application to min concave cost flow problems},
journal = {Networks},
volume = {9},
number = {2},
pages = {95--121},
year = {1979},
url = {https://doi.org/10.1002/net.3230090202},
doi = {10.1002/NET.3230090202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GalloS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Golden79,
author = {Bruce L. Golden},
title = {Topics in Combinatorial Optimization. Edited By S. Rinaldi, Springer-Verlag
New York, New York, 1975, {\textdollar}15.20, 186 Pages},
journal = {Networks},
volume = {9},
number = {1},
pages = {89--90},
year = {1979},
url = {https://doi.org/10.1002/net.3230090106},
doi = {10.1002/NET.3230090106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Golden79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenA79,
author = {Bruce L. Golden and
Arjang A. Assad},
title = {Optimization Algorithms for Networks and Graphs. By Edward Minieka,
Marcel Dekker, Inc. New York, New York, 1978, {\textdollar}19.75,
356 Pages},
journal = {Networks},
volume = {9},
number = {1},
pages = {91--93},
year = {1979},
url = {https://doi.org/10.1002/net.3230090107},
doi = {10.1002/NET.3230090107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenA79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Halpern79,
author = {Jonathan Halpern},
title = {A generalized dynamic flows problem},
journal = {Networks},
volume = {9},
number = {2},
pages = {133--167},
year = {1979},
url = {https://doi.org/10.1002/net.3230090204},
doi = {10.1002/NET.3230090204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Halpern79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HwangL79,
author = {Frank K. Hwang and
Shen Lin},
title = {On the construction of balanced switching networks},
journal = {Networks},
volume = {9},
number = {4},
pages = {283--307},
year = {1979},
url = {https://doi.org/10.1002/net.3230090402},
doi = {10.1002/NET.3230090402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HwangL79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Jenkyns79,
author = {T. A. Jenkyns},
title = {The greedy travelling salesman's problem},
journal = {Networks},
volume = {9},
number = {4},
pages = {363--373},
year = {1979},
url = {https://doi.org/10.1002/net.3230090406},
doi = {10.1002/NET.3230090406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Jenkyns79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KrishnamoorthyD79,
author = {Mukkai S. Krishnamoorthy and
Narsingh Deo},
title = {Complexity of the minimum-dummy-activities problem in a pert network},
journal = {Networks},
volume = {9},
number = {3},
pages = {189--194},
year = {1979},
url = {https://doi.org/10.1002/net.3230090302},
doi = {10.1002/NET.3230090302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KrishnamoorthyD79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/McCallum79,
author = {Charles J. McCallum Jr.},
title = {Linear and combinatorial programming. By Katta G. Murty, John Wiley
{\&}Sons, Inc., New York, {N.Y.} 1976, {\textdollar}21.00, 567
pages},
journal = {Networks},
volume = {9},
number = {2},
pages = {185--186},
year = {1979},
url = {https://doi.org/10.1002/net.3230090206},
doi = {10.1002/NET.3230090206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/McCallum79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OnagaM79,
author = {K. Onaga and
Wataru Mayeda},
title = {A boolean theory of network flows and metrics and its applications
to particle transmission and clustering},
journal = {Networks},
volume = {9},
number = {3},
pages = {249--281},
year = {1979},
url = {https://doi.org/10.1002/net.3230090305},
doi = {10.1002/NET.3230090305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OnagaM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RussellI79,
author = {R. Russell and
W. Igo},
title = {An assignment routing problem},
journal = {Networks},
volume = {9},
number = {1},
pages = {1--17},
year = {1979},
url = {https://doi.org/10.1002/net.3230090102},
doi = {10.1002/NET.3230090102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RussellI79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Shapiro79,
author = {Stephen D. Shapiro},
title = {A stochastic petri net with applications to modelling occupancy times
for concurrent task systems},
journal = {Networks},
volume = {9},
number = {4},
pages = {375--379},
year = {1979},
url = {https://doi.org/10.1002/net.3230090407},
doi = {10.1002/NET.3230090407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Shapiro79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Shier79,
author = {Douglas R. Shier},
title = {On algorithms for finding the k shortest paths in a network},
journal = {Networks},
volume = {9},
number = {3},
pages = {195--214},
year = {1979},
url = {https://doi.org/10.1002/net.3230090303},
doi = {10.1002/NET.3230090303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Shier79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Smith79,
author = {R. L. Smith},
title = {Deferral strategies for a dynamic communications network},
journal = {Networks},
volume = {9},
number = {1},
pages = {61--87},
year = {1979},
url = {https://doi.org/10.1002/net.3230090105},
doi = {10.1002/NET.3230090105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Smith79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/StanatM79,
author = {Donald F. Stanat and
Gyula A. Mag{\'{o}}},
title = {Minimizing maximum flows in linear graphs},
journal = {Networks},
volume = {9},
number = {4},
pages = {333--361},
year = {1979},
url = {https://doi.org/10.1002/net.3230090405},
doi = {10.1002/NET.3230090405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/StanatM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Syslo79,
author = {Maciej M. Syslo},
title = {On cycle bases of a graph},
journal = {Networks},
volume = {9},
number = {2},
pages = {123--132},
year = {1979},
url = {https://doi.org/10.1002/net.3230090203},
doi = {10.1002/NET.3230090203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Syslo79.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-09-01 08:01 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:
