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/networks14.bht:"
download as .bib file
@article{DBLP:journals/networks/Beasley84,
author = {John E. Beasley},
title = {An algorithm for the steiner problem in graphs},
journal = {Networks},
volume = {14},
number = {1},
pages = {147--159},
year = {1984},
url = {https://doi.org/10.1002/net.3230140112},
doi = {10.1002/NET.3230140112},
timestamp = {Mon, 24 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Beasley84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Boesch84,
author = {Francis T. Boesch},
title = {Reviews in graph theory, edited by William G. Brown, American Mathematical
Society, 1980. Volumes I, II, III, {IV} (paperback)},
journal = {Networks},
volume = {14},
number = {1},
pages = {173},
year = {1984},
url = {https://doi.org/10.1002/net.3230140114},
doi = {10.1002/NET.3230140114},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Boesch84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Caccetta84,
author = {Louis Caccetta},
title = {Vulnerability of communication networks},
journal = {Networks},
volume = {14},
number = {1},
pages = {141--146},
year = {1984},
url = {https://doi.org/10.1002/net.3230140111},
doi = {10.1002/NET.3230140111},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Caccetta84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CareyH84,
author = {Malachy Carey and
Chris Hendrickson},
title = {Bounds on expected performance of networks with links subject to failure},
journal = {Networks},
volume = {14},
number = {3},
pages = {439--456},
year = {1984},
url = {https://doi.org/10.1002/net.3230140307},
doi = {10.1002/NET.3230140307},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CareyH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Cheston84,
author = {Grant A. Cheston},
title = {On-line connectivity algorithms},
journal = {Networks},
volume = {14},
number = {1},
pages = {83--94},
year = {1984},
url = {https://doi.org/10.1002/net.3230140108},
doi = {10.1002/NET.3230140108},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Cheston84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChristofidesB84,
author = {Nicos Christofides and
John E. Beasley},
title = {The period routing problem},
journal = {Networks},
volume = {14},
number = {2},
pages = {237--256},
year = {1984},
url = {https://doi.org/10.1002/net.3230140205},
doi = {10.1002/NET.3230140205},
timestamp = {Mon, 24 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChristofidesB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DeoP84,
author = {Narsingh Deo and
Chi{-}Yin Pang},
title = {Shortest-path algorithms: Taxonomy and annotation},
journal = {Networks},
volume = {14},
number = {2},
pages = {275--323},
year = {1984},
url = {https://doi.org/10.1002/net.3230140208},
doi = {10.1002/NET.3230140208},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DeoP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DesrosiersSD84,
author = {Jacques Desrosiers and
Fran{\c{c}}ois Soumis and
Martin Desrochers},
title = {Routing with time windows by column generation},
journal = {Networks},
volume = {14},
number = {4},
pages = {545--565},
year = {1984},
url = {https://doi.org/10.1002/net.3230140406},
doi = {10.1002/NET.3230140406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DesrosiersSD84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EsfahanianH84,
author = {Abdol{-}Hossein Esfahanian and
S. Louis Hakimi},
title = {On computing the connectivities of graphs and digraphs},
journal = {Networks},
volume = {14},
number = {2},
pages = {355--366},
year = {1984},
url = {https://doi.org/10.1002/net.3230140211},
doi = {10.1002/NET.3230140211},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EsfahanianH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EvenGMT84,
author = {Shimon Even and
Oded Goldreich and
Shlomo Moran and
Po Tong},
title = {On the np-completeness of certain network testing problems},
journal = {Networks},
volume = {14},
number = {1},
pages = {1--24},
year = {1984},
url = {https://doi.org/10.1002/net.3230140102},
doi = {10.1002/NET.3230140102},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/EvenGMT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Garcia-DiazFB84,
author = {Alberto Garcia{-}Diaz and
Donald K. Friesen and
Donald J. Bagert},
title = {Sorting algorithms for the implementation of a generalized vector
product},
journal = {Networks},
volume = {14},
number = {2},
pages = {269--273},
year = {1984},
url = {https://doi.org/10.1002/net.3230140207},
doi = {10.1002/NET.3230140207},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Garcia-DiazFB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gazmuri84,
author = {Pedro G. Gazmuri},
title = {Independent sets in random sparse graphs},
journal = {Networks},
volume = {14},
number = {3},
pages = {367--377},
year = {1984},
url = {https://doi.org/10.1002/net.3230140302},
doi = {10.1002/NET.3230140302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gazmuri84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GloverGK84,
author = {Fred W. Glover and
Randy Glover and
Darwin Klingman},
title = {Computational study of an improved shortest path algorithm},
journal = {Networks},
volume = {14},
number = {1},
pages = {25--36},
year = {1984},
url = {https://doi.org/10.1002/net.3230140103},
doi = {10.1002/NET.3230140103},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GloverGK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Greis84,
author = {Noel P. Greis},
title = {Introduction to mathematical programming: Quantitative tools for decision-making,
by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982,
287 pp. Price: {\textdollar}39.50},
journal = {Networks},
volume = {14},
number = {1},
pages = {178--179},
year = {1984},
url = {https://doi.org/10.1002/net.3230140118},
doi = {10.1002/NET.3230140118},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Greis84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hagstrom84,
author = {Jane N. Hagstrom},
title = {Note on independence of arcs in antiparallel for network flow problems},
journal = {Networks},
volume = {14},
number = {4},
pages = {567--570},
year = {1984},
url = {https://doi.org/10.1002/net.3230140407},
doi = {10.1002/NET.3230140407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hagstrom84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HajekO84,
author = {Bruce E. Hajek and
Richard G. Ogier},
title = {Optimal dynamic routing in communication networks with continuous
traffic},
journal = {Networks},
volume = {14},
number = {3},
pages = {457--487},
year = {1984},
url = {https://doi.org/10.1002/net.3230140308},
doi = {10.1002/NET.3230140308},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HajekO84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hassin84,
author = {Refael Hassin},
title = {On multicommodity flows in planar graphs},
journal = {Networks},
volume = {14},
number = {2},
pages = {225--235},
year = {1984},
url = {https://doi.org/10.1002/net.3230140204},
doi = {10.1002/NET.3230140204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hassin84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/He84,
author = {Qi{-}Mei He},
title = {An extremal problem on the connectivity of graphs},
journal = {Networks},
volume = {14},
number = {2},
pages = {337--354},
year = {1984},
url = {https://doi.org/10.1002/net.3230140210},
doi = {10.1002/NET.3230140210},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/He84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ikura84,
author = {Yoshi Ikura},
title = {Network optimization practice: {A} Computational Guide, by D. K. Smith,
John Wiley, New York, 1982, 237 pp. Price: {\textdollar}59.95},
journal = {Networks},
volume = {14},
number = {4},
pages = {597--598},
year = {1984},
url = {https://doi.org/10.1002/net.3230140411},
doi = {10.1002/NET.3230140411},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ikura84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ItaiP84,
author = {A. Itai and
D. K. Pradhan},
title = {Synthesis of directed multicommodity flow networks},
journal = {Networks},
volume = {14},
number = {2},
pages = {213--224},
year = {1984},
url = {https://doi.org/10.1002/net.3230140203},
doi = {10.1002/NET.3230140203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ItaiP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Jaffe84,
author = {Jeffrey M. Jaffe},
title = {Algorithms for finding paths with multiple constraints},
journal = {Networks},
volume = {14},
number = {1},
pages = {95--116},
year = {1984},
url = {https://doi.org/10.1002/net.3230140109},
doi = {10.1002/NET.3230140109},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Jaffe84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Johnson84,
author = {Marjory J. Johnson},
title = {Updating routing tables after resource failure in a distributed computer
network},
journal = {Networks},
volume = {14},
number = {3},
pages = {379--391},
year = {1984},
url = {https://doi.org/10.1002/net.3230140303},
doi = {10.1002/NET.3230140303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Johnson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Johnson84a,
author = {R. Johnson},
title = {Network reliability and acyclic orientations},
journal = {Networks},
volume = {14},
number = {4},
pages = {489--505},
year = {1984},
url = {https://doi.org/10.1002/net.3230140402},
doi = {10.1002/NET.3230140402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Johnson84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LapaughP84,
author = {Andrea S. LaPaugh and
Christos H. Papadimitriou},
title = {The even-path problem for graphs and digraphs},
journal = {Networks},
volume = {14},
number = {4},
pages = {507--513},
year = {1984},
url = {https://doi.org/10.1002/net.3230140403},
doi = {10.1002/NET.3230140403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LapaughP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LaporteDN84,
author = {Gilbert Laporte and
Martin Desrochers and
Yves Nobert},
title = {Two exact algorithms for the distance-constrained vehicle routing
problem},
journal = {Networks},
volume = {14},
number = {1},
pages = {161--172},
year = {1984},
url = {https://doi.org/10.1002/net.3230140113},
doi = {10.1002/NET.3230140113},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LaporteDN84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LeeP84,
author = {D. T. Lee and
Franco P. Preparata},
title = {Euclidean shortest paths in the presence of rectilinear barriers},
journal = {Networks},
volume = {14},
number = {3},
pages = {393--410},
year = {1984},
url = {https://doi.org/10.1002/net.3230140304},
doi = {10.1002/NET.3230140304},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LeeP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LiuW84,
author = {Chen{-}Ching Liu and
Felix F. Wu},
title = {a generalized network flow model with application to power supply-demand
problems},
journal = {Networks},
volume = {14},
number = {1},
pages = {117--139},
year = {1984},
url = {https://doi.org/10.1002/net.3230140110},
doi = {10.1002/NET.3230140110},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LiuW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Mallick84,
author = {John A. Mallick},
title = {Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead,
Ellis Horwood Limited, London, 1982, 151 pp. Price: {\textdollar}44.95},
journal = {Networks},
volume = {14},
number = {1},
pages = {176--177},
year = {1984},
url = {https://doi.org/10.1002/net.3230140116},
doi = {10.1002/NET.3230140116},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Mallick84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Minieka84,
author = {Edward Minieka},
title = {Graph theory and applications, by H. Neville V. Temperley, Halsted
Press, New York, 1981, 130 pp. Price: {\textdollar}44.95},
journal = {Networks},
volume = {14},
number = {4},
pages = {597},
year = {1984},
url = {https://doi.org/10.1002/net.3230140410},
doi = {10.1002/NET.3230140410},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Minieka84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OhuchiK84,
author = {Azuma Ohuchi and
Ikuo Kaji},
title = {Lagrangian dual coordinatewise maximization algorithm for network
transportation problems with quadratic costs},
journal = {Networks},
volume = {14},
number = {4},
pages = {515--530},
year = {1984},
url = {https://doi.org/10.1002/net.3230140404},
doi = {10.1002/NET.3230140404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OhuchiK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Pallottino84,
author = {Stefano Pallottino},
title = {Shortest-path methods: Complexity, interrelations and new propositions},
journal = {Networks},
volume = {14},
number = {2},
pages = {257--267},
year = {1984},
url = {https://doi.org/10.1002/net.3230140206},
doi = {10.1002/NET.3230140206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Pallottino84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PangY84,
author = {Jong{-}Shi Pang and
Chang{-}Sung Yu},
title = {A special spatial equilibrium problem},
journal = {Networks},
volume = {14},
number = {1},
pages = {75--81},
year = {1984},
url = {https://doi.org/10.1002/net.3230140107},
doi = {10.1002/NET.3230140107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PangY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PangY84a,
author = {Jong{-}Shi Pang and
Chang{-}Sung Yu},
title = {Linearized simplicial decomposition methods for computing traffic
equilibria on networks},
journal = {Networks},
volume = {14},
number = {3},
pages = {427--438},
year = {1984},
url = {https://doi.org/10.1002/net.3230140306},
doi = {10.1002/NET.3230140306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PangY84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Psaraftis84,
author = {Harilaos N. Psaraftis},
title = {On the practical importance of asymptotic optimality in certain heuristic
algorithms},
journal = {Networks},
volume = {14},
number = {4},
pages = {587--596},
year = {1984},
url = {https://doi.org/10.1002/net.3230140409},
doi = {10.1002/NET.3230140409},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Psaraftis84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/QueyranneQ84,
author = {Maurice Queyranne},
title = {Dynamic programming: Models and applications, by Eric V. Denardo,
Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: {\textdollar}26.95},
journal = {Networks},
volume = {14},
number = {1},
pages = {174--175},
year = {1984},
url = {https://doi.org/10.1002/net.3230140115},
doi = {10.1002/NET.3230140115},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/QueyranneQ84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RonenP84,
author = {D. Ronen and
Yehoshua Perl},
title = {Heuristics for finding a maximum number of disjoint bounded paths},
journal = {Networks},
volume = {14},
number = {4},
pages = {531--544},
year = {1984},
url = {https://doi.org/10.1002/net.3230140405},
doi = {10.1002/NET.3230140405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RonenP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Schumacher84,
author = {Ulrich Schumacher},
title = {An algorithm for construction of a \emph{k}-connected graph with minimum
number of edges and quasiminimal diameter},
journal = {Networks},
volume = {14},
number = {1},
pages = {63--74},
year = {1984},
url = {https://doi.org/10.1002/net.3230140106},
doi = {10.1002/NET.3230140106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Schumacher84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Smith84,
author = {Derek Smith},
title = {Graphs with the smallest number of minimum cut sets},
journal = {Networks},
volume = {14},
number = {1},
pages = {47--61},
year = {1984},
url = {https://doi.org/10.1002/net.3230140105},
doi = {10.1002/NET.3230140105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Smith84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SpaccamelaKS84,
author = {Alberto Marchetti{-}Spaccamela and
A. H. G. Rinnooy Kan and
Leen Stougie},
title = {Hierarchical vehicle routing problems},
journal = {Networks},
volume = {14},
number = {4},
pages = {571--586},
year = {1984},
url = {https://doi.org/10.1002/net.3230140408},
doi = {10.1002/NET.3230140408},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SpaccamelaKS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Steiner84,
author = {George Steiner},
title = {Mathematical aspects of scheduling and applications, by R. Bellman,
A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price:
{\textdollar}19.50},
journal = {Networks},
volume = {14},
number = {1},
pages = {177--178},
year = {1984},
url = {https://doi.org/10.1002/net.3230140117},
doi = {10.1002/NET.3230140117},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Steiner84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Storer84,
author = {James A. Storer},
title = {On minimal-node-cost planar embeddings},
journal = {Networks},
volume = {14},
number = {2},
pages = {181--212},
year = {1984},
url = {https://doi.org/10.1002/net.3230140202},
doi = {10.1002/NET.3230140202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Storer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SuurballeT84,
author = {J. W. Suurballe and
Robert Endre Tarjan},
title = {A quick method for finding shortest pairs of disjoint paths},
journal = {Networks},
volume = {14},
number = {2},
pages = {325--336},
year = {1984},
url = {https://doi.org/10.1002/net.3230140209},
doi = {10.1002/NET.3230140209},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SuurballeT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Syslo84,
author = {Maciej M. Syslo},
title = {On the computational complexity of the minimum-dummy-activities problem
in a pert network},
journal = {Networks},
volume = {14},
number = {1},
pages = {37--45},
year = {1984},
url = {https://doi.org/10.1002/net.3230140104},
doi = {10.1002/NET.3230140104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Syslo84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Whitt84,
author = {Ward Whitt},
title = {The amount of overtaking in a network of queues},
journal = {Networks},
volume = {14},
number = {3},
pages = {411--426},
year = {1984},
url = {https://doi.org/10.1002/net.3230140305},
doi = {10.1002/NET.3230140305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Whitt84.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-05-21 06:26 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:
