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/networks19.bht:"
download as .bib file
@article{DBLP:journals/networks/AgarwalMS89,
author = {Yogesh Agarwal and
Kamlesh Mathur and
Harvey M. Salkin},
title = {A set-partitioning-based exact algorithm for the vehicle routing problem},
journal = {Networks},
volume = {19},
number = {7},
pages = {731--749},
year = {1989},
url = {https://doi.org/10.1002/net.3230190702},
doi = {10.1002/NET.3230190702},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AgarwalMS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AndersonP89,
author = {Edward J. Anderson and
Andrew B. Philpott},
title = {A continuous-time network simplex algorithm},
journal = {Networks},
volume = {19},
number = {4},
pages = {395--425},
year = {1989},
url = {https://doi.org/10.1002/net.3230190403},
doi = {10.1002/NET.3230190403},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AndersonP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalakrishnanG89,
author = {Anantharam Balakrishnan and
Stephen C. Graves},
title = {A composite algorithm for a concave-cost network flow problem},
journal = {Networks},
volume = {19},
number = {2},
pages = {175--202},
year = {1989},
url = {https://doi.org/10.1002/net.3230190202},
doi = {10.1002/NET.3230190202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BalakrishnanG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Balas89,
author = {Egon Balas},
title = {The prize collecting traveling salesman problem},
journal = {Networks},
volume = {19},
number = {6},
pages = {621--636},
year = {1989},
url = {https://doi.org/10.1002/net.3230190602},
doi = {10.1002/NET.3230190602},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Balas89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalasY89,
author = {Egon Balas and
Chang Sung Yu},
title = {On graphs with polynomially solvable maximum-weight clique problem},
journal = {Networks},
volume = {19},
number = {2},
pages = {247--253},
year = {1989},
url = {https://doi.org/10.1002/net.3230190206},
doi = {10.1002/NET.3230190206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BalasY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BattaB89,
author = {Rajan Batta and
Oded Berman},
title = {A location model for a facility operating as an \emph{M/G/k} queue},
journal = {Networks},
volume = {19},
number = {6},
pages = {717--728},
year = {1989},
url = {https://doi.org/10.1002/net.3230190609},
doi = {10.1002/NET.3230190609},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BattaB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Beasley89,
author = {John E. Beasley},
title = {An SST-based algorithm for the steiner problem in graphs},
journal = {Networks},
volume = {19},
number = {1},
pages = {1--16},
year = {1989},
url = {https://doi.org/10.1002/net.3230190102},
doi = {10.1002/NET.3230190102},
timestamp = {Mon, 24 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Beasley89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BeasleyC89,
author = {John E. Beasley and
Nicos Christofides},
title = {An algorithm for the resource constrained shortest path problem},
journal = {Networks},
volume = {19},
number = {4},
pages = {379--394},
year = {1989},
url = {https://doi.org/10.1002/net.3230190402},
doi = {10.1002/NET.3230190402},
timestamp = {Mon, 24 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BeasleyC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BienstockM89,
author = {Daniel Bienstock and
Clyde L. Monma},
title = {Optimal enclosing regions in planar graphs},
journal = {Networks},
volume = {19},
number = {1},
pages = {79--94},
year = {1989},
url = {https://doi.org/10.1002/net.3230190107},
doi = {10.1002/NET.3230190107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BienstockM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrechtC89,
author = {Timothy B. Brecht and
Charles J. Colbourn},
title = {Multiplicative improvements in network reliability bounds},
journal = {Networks},
volume = {19},
number = {5},
pages = {521--529},
year = {1989},
url = {https://doi.org/10.1002/net.3230190504},
doi = {10.1002/NET.3230190504},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrechtC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Burns89,
author = {James E. Burns},
title = {The maximum independent set problem for cubic planar graphs},
journal = {Networks},
volume = {19},
number = {3},
pages = {373--378},
year = {1989},
url = {https://doi.org/10.1002/net.3230190307},
doi = {10.1002/NET.3230190307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Burns89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CaiS89,
author = {Guo{-}Ray Cai and
Yu{-}Geng Sun},
title = {The minimum augmentation of any graph to a \emph{K}-edge-connected
graph},
journal = {Networks},
volume = {19},
number = {1},
pages = {151--172},
year = {1989},
url = {https://doi.org/10.1002/net.3230190112},
doi = {10.1002/NET.3230190112},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CaiS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CarpanetoDFT89,
author = {Giorgio Carpaneto and
Mauro Dell'Amico and
Matteo Fischetti and
Paolo Toth},
title = {A branch and bound algorithm for the multiple depot vehicle scheduling
problem},
journal = {Networks},
volume = {19},
number = {5},
pages = {531--548},
year = {1989},
url = {https://doi.org/10.1002/net.3230190505},
doi = {10.1002/NET.3230190505},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CarpanetoDFT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Doty89,
author = {Lynne L. Doty},
title = {Extremal connectivity and vulnerability in graphs},
journal = {Networks},
volume = {19},
number = {1},
pages = {73--78},
year = {1989},
url = {https://doi.org/10.1002/net.3230190106},
doi = {10.1002/NET.3230190106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Doty89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuinV89,
author = {C. W. Duin and
A. Volgenant},
title = {Reduction tests for the steiner problem in grapsh},
journal = {Networks},
volume = {19},
number = {5},
pages = {549--567},
year = {1989},
url = {https://doi.org/10.1002/net.3230190506},
doi = {10.1002/NET.3230190506},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DuinV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FarragD89,
author = {Abdel Aziz Farrag and
Robert J. Dawson},
title = {Designing optimal fault-tolerant star networks},
journal = {Networks},
volume = {19},
number = {6},
pages = {707--716},
year = {1989},
url = {https://doi.org/10.1002/net.3230190608},
doi = {10.1002/NET.3230190608},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FarragD89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FavaronKM89,
author = {Odile Favaron and
Mekkia Kouider and
Maryvonne Mah{\'{e}}o},
title = {Edge-vulnerability and mean distance},
journal = {Networks},
volume = {19},
number = {5},
pages = {493--504},
year = {1989},
url = {https://doi.org/10.1002/net.3230190502},
doi = {10.1002/NET.3230190502},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FavaronKM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FiatS89,
author = {Amos Fiat and
Adi Shamir},
title = {How to find a battleship},
journal = {Networks},
volume = {19},
number = {3},
pages = {361--371},
year = {1989},
url = {https://doi.org/10.1002/net.3230190306},
doi = {10.1002/NET.3230190306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FiatS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FinbowH89,
author = {Art S. Finbow and
Bert L. Hartnell},
title = {On designing a network to defend against random attacks of radius
two},
journal = {Networks},
volume = {19},
number = {7},
pages = {771--792},
year = {1989},
url = {https://doi.org/10.1002/net.3230190704},
doi = {10.1002/NET.3230190704},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/FinbowH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GarganoV89,
author = {Luisa Gargano and
Ugo Vaccaro},
title = {On the construction of minimal broadcast networks},
journal = {Networks},
volume = {19},
number = {6},
pages = {673--689},
year = {1989},
url = {https://doi.org/10.1002/net.3230190606},
doi = {10.1002/NET.3230190606},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GarganoV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gilbert89,
author = {Edgar N. Gilbert},
title = {A solvable routing problem},
journal = {Networks},
volume = {19},
number = {5},
pages = {587--594},
year = {1989},
url = {https://doi.org/10.1002/net.3230190508},
doi = {10.1002/NET.3230190508},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gilbert89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HammerMP89,
author = {Peter Ladislaw Hammer and
Nadimpalli V. R. Mahadev and
Uri N. Peled},
title = {Some properties of 2-threshold graphs},
journal = {Networks},
volume = {19},
number = {1},
pages = {17--23},
year = {1989},
url = {https://doi.org/10.1002/net.3230190103},
doi = {10.1002/NET.3230190103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HammerMP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HansenL89,
author = {Pierre Hansen and
Martine Labb{\'{e}}},
title = {The continuous \emph{p}-median of a network},
journal = {Networks},
volume = {19},
number = {5},
pages = {595--606},
year = {1989},
url = {https://doi.org/10.1002/net.3230190509},
doi = {10.1002/NET.3230190509},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HansenL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HelmeM89,
author = {Marcia P. Helme and
Thomas L. Magnanti},
title = {Designing satellite communication networks by zero - one quadratic
programming},
journal = {Networks},
volume = {19},
number = {4},
pages = {427--450},
year = {1989},
url = {https://doi.org/10.1002/net.3230190404},
doi = {10.1002/NET.3230190404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HelmeM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hendry89,
author = {George R. T. Hendry},
title = {On mean distance in certain classes of graphs},
journal = {Networks},
volume = {19},
number = {4},
pages = {451--457},
year = {1989},
url = {https://doi.org/10.1002/net.3230190405},
doi = {10.1002/NET.3230190405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hendry89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HochbaumS89,
author = {Dorit S. Hochbaum and
Arie Segev},
title = {Analysis of a flow problem with fixed charges},
journal = {Networks},
volume = {19},
number = {3},
pages = {291--312},
year = {1989},
url = {https://doi.org/10.1002/net.3230190304},
doi = {10.1002/NET.3230190304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HochbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hooker89,
author = {John N. Hooker},
title = {Solving nonlinear multiple-facility network location problems},
journal = {Networks},
volume = {19},
number = {1},
pages = {117--133},
year = {1989},
url = {https://doi.org/10.1002/net.3230190110},
doi = {10.1002/NET.3230190110},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hooker89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Huseby89,
author = {Arne Bang Huseby},
title = {Domination theory and the crapo {\(\beta\)}-invariant},
journal = {Networks},
volume = {19},
number = {1},
pages = {135--149},
year = {1989},
url = {https://doi.org/10.1002/net.3230190111},
doi = {10.1002/NET.3230190111},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Huseby89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Jain89,
author = {Anjani Jain},
title = {Probabilistic analysis of an lp relaxation bound for the steiner problem
in networks},
journal = {Networks},
volume = {19},
number = {7},
pages = {793--801},
year = {1989},
url = {https://doi.org/10.1002/net.3230190705},
doi = {10.1002/NET.3230190705},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Jain89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JohnsonP89,
author = {R. Johnson and
M. G. Pilcher},
title = {The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra,
{A.H.G.} Rinnooy Kan, and {D.B.} Shmoys, John Wiley {\&} sons,
chichester, 1985, 463 pp},
journal = {Networks},
volume = {19},
number = {5},
pages = {615--616},
year = {1989},
url = {https://doi.org/10.1002/net.3230190511},
doi = {10.1002/NET.3230190511},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/JohnsonP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Kaveh89,
author = {Ali Kaveh},
title = {On optimal cycle bases of graphs for mesh analysis of networks},
journal = {Networks},
volume = {19},
number = {3},
pages = {273--279},
year = {1989},
url = {https://doi.org/10.1002/net.3230190302},
doi = {10.1002/NET.3230190302},
timestamp = {Wed, 04 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Kaveh89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Klincewicz89,
author = {John G. Klincewicz},
title = {Implementing an "exact" Newton method for separable convex transportation
problems},
journal = {Networks},
volume = {19},
number = {1},
pages = {95--105},
year = {1989},
url = {https://doi.org/10.1002/net.3230190108},
doi = {10.1002/NET.3230190108},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Klincewicz89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KrishnamoorthyTS89,
author = {V. Krishnamoorthy and
Krishnaiyan Thulasiraman and
M. N. S. Swamy},
title = {Minimum order graphs with specified diameter, connectivity, and regularity},
journal = {Networks},
volume = {19},
number = {1},
pages = {25--46},
year = {1989},
url = {https://doi.org/10.1002/net.3230190104},
doi = {10.1002/NET.3230190104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KrishnamoorthyTS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LabbeT89,
author = {Martine Labb{\'{e}} and
Jacques{-}Fran{\c{c}}ois Thisse},
title = {A tree-network has the fixed point property},
journal = {Networks},
volume = {19},
number = {2},
pages = {255--259},
year = {1989},
url = {https://doi.org/10.1002/net.3230190207},
doi = {10.1002/NET.3230190207},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LabbeT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LesniakP89,
author = {Linda M. Lesniak and
Raymond E. Pippert},
title = {On the edge-connectivity vector of a graph},
journal = {Networks},
volume = {19},
number = {6},
pages = {667--671},
year = {1989},
url = {https://doi.org/10.1002/net.3230190605},
doi = {10.1002/NET.3230190605},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LesniakP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LessardRM89,
author = {R{\'{e}}jean Lessard and
Jean{-}Marc Rousseau and
Michel Minoux},
title = {A new algorithm for general matching problems using network flow subproblems},
journal = {Networks},
volume = {19},
number = {4},
pages = {459--479},
year = {1989},
url = {https://doi.org/10.1002/net.3230190406},
doi = {10.1002/NET.3230190406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LessardRM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Lieberman89,
author = {Warren H. Lieberman},
title = {Growth and Development, Ecosystems Phenomenology by Robert E. Ulanowicz,
springer-Verlag, New York, 1986, 178 pp},
journal = {Networks},
volume = {19},
number = {2},
pages = {269--270},
year = {1989},
url = {https://doi.org/10.1002/net.3230190209},
doi = {10.1002/NET.3230190209},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Lieberman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Martel89,
author = {Charles U. Martel},
title = {A comparison of phase and nonphase network flow algorithms},
journal = {Networks},
volume = {19},
number = {6},
pages = {691--705},
year = {1989},
url = {https://doi.org/10.1002/net.3230190607},
doi = {10.1002/NET.3230190607},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Martel89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MillerP89,
author = {Zevi Miller and
Dan Pritikin},
title = {On the separation number of a graph},
journal = {Networks},
volume = {19},
number = {6},
pages = {651--666},
year = {1989},
url = {https://doi.org/10.1002/net.3230190604},
doi = {10.1002/NET.3230190604},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MillerP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Minoux89,
author = {Michel Minoux},
title = {Networks synthesis and optimum network design problems: Models, solution
methods and applications},
journal = {Networks},
volume = {19},
number = {3},
pages = {313--360},
year = {1989},
url = {https://doi.org/10.1002/net.3230190305},
doi = {10.1002/NET.3230190305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Minoux89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Moran89,
author = {Shlomo Moran},
title = {Message complexity versus space complexity in fault tolerant broadcast
protocols},
journal = {Networks},
volume = {19},
number = {5},
pages = {505--519},
year = {1989},
url = {https://doi.org/10.1002/net.3230190503},
doi = {10.1002/NET.3230190503},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Moran89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Mrozek89,
author = {Marian Mrozek},
title = {Transitively reduced and transitively closed event networks},
journal = {Networks},
volume = {19},
number = {1},
pages = {47--72},
year = {1989},
url = {https://doi.org/10.1002/net.3230190105},
doi = {10.1002/NET.3230190105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Mrozek89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagurneyA89,
author = {Anna Nagurney and
Jay Aronson},
title = {A general dynamic spatial price network equilibrium model with gains
and losses},
journal = {Networks},
volume = {19},
number = {7},
pages = {751--769},
year = {1989},
url = {https://doi.org/10.1002/net.3230190703},
doi = {10.1002/NET.3230190703},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagurneyA89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PelegS89,
author = {David Peleg and
Alejandro A. Sch{\"{a}}ffer},
title = {Time bounds on fault-tolerant broadcasting},
journal = {Networks},
volume = {19},
number = {7},
pages = {803--822},
year = {1989},
url = {https://doi.org/10.1002/net.3230190706},
doi = {10.1002/NET.3230190706},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PelegS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ProvanK89,
author = {J. Scott Provan and
Vidyadhar G. Kulkarni},
title = {Exact cuts in networks},
journal = {Networks},
volume = {19},
number = {3},
pages = {281--289},
year = {1989},
url = {https://doi.org/10.1002/net.3230190303},
doi = {10.1002/NET.3230190303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ProvanK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RobertsX89,
author = {Fred S. Roberts and
Yonghua Xu},
title = {On the optimal strongly connected orientations of city street graphs.
{II:} Two east-west avenues or North - South Streets},
journal = {Networks},
volume = {19},
number = {2},
pages = {221--233},
year = {1989},
url = {https://doi.org/10.1002/net.3230190204},
doi = {10.1002/NET.3230190204},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/RobertsX89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Sancho89,
author = {N. G. F. Sancho},
title = {A functional equation for finding the largest expected capacity of
a graph},
journal = {Networks},
volume = {19},
number = {2},
pages = {261--268},
year = {1989},
url = {https://doi.org/10.1002/net.3230190208},
doi = {10.1002/NET.3230190208},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Sancho89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShiJ89,
author = {Weigeng Shi and
Ronald J. Juels},
title = {Connected reorientations of mixed multigraphs},
journal = {Networks},
volume = {19},
number = {2},
pages = {235--246},
year = {1989},
url = {https://doi.org/10.1002/net.3230190205},
doi = {10.1002/NET.3230190205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShiJ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Sun89,
author = {Jie Sun},
title = {Tracing the characteristic curve of a quadratic black box},
journal = {Networks},
volume = {19},
number = {6},
pages = {637--650},
year = {1989},
url = {https://doi.org/10.1002/net.3230190603},
doi = {10.1002/NET.3230190603},
timestamp = {Sun, 27 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Sun89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Vate89,
author = {John H. Vande Vate},
title = {The path set polytope of an acyclic, directed graph with an application
to machine sequencing},
journal = {Networks},
volume = {19},
number = {5},
pages = {607--614},
year = {1989},
url = {https://doi.org/10.1002/net.3230190510},
doi = {10.1002/NET.3230190510},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Vate89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Venkateswaran89,
author = {V. Venkateswaran},
title = {Linear programming and network modesl, by S. K. Gupta, affiliated
East-West Press Pvt. Ltd. New Delhi, 1985, 230 pp},
journal = {Networks},
volume = {19},
number = {1},
pages = {173},
year = {1989},
url = {https://doi.org/10.1002/net.3230190113},
doi = {10.1002/NET.3230190113},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Venkateswaran89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WellsE89,
author = {Charles E. Wells and
James R. Evans},
title = {Statistical procedures for estimating branch flows and total network
flow},
journal = {Networks},
volume = {19},
number = {4},
pages = {481--491},
year = {1989},
url = {https://doi.org/10.1002/net.3230190407},
doi = {10.1002/NET.3230190407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WellsE89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WerraP89,
author = {Dominique de Werra and
C. Pasche},
title = {Paths, chains, and antipaths},
journal = {Networks},
volume = {19},
number = {1},
pages = {107--115},
year = {1989},
url = {https://doi.org/10.1002/net.3230190109},
doi = {10.1002/NET.3230190109},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WerraP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Wood89,
author = {R. Kevin Wood},
title = {Triconnected decomposition for computing \emph{K}-terminal network
reliability},
journal = {Networks},
volume = {19},
number = {2},
pages = {203--220},
year = {1989},
url = {https://doi.org/10.1002/net.3230190203},
doi = {10.1002/NET.3230190203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Wood89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Yurkiewicz89,
author = {Jack Yurkiewicz},
title = {Operations research: Applications and algorithms, by Wayne L. Winston,
duxbury Press, Boston, 1987, 1025 pages},
journal = {Networks},
volume = {19},
number = {5},
pages = {616--618},
year = {1989},
url = {https://doi.org/10.1002/net.3230190512},
doi = {10.1002/NET.3230190512},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Yurkiewicz89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ZeniosDM89,
author = {Stavros A. Zenios and
Arne Drud and
John M. Mulvey},
title = {Balancing large social accounting matrices with nonlinear network
programming},
journal = {Networks},
volume = {19},
number = {5},
pages = {569--585},
year = {1989},
url = {https://doi.org/10.1002/net.3230190507},
doi = {10.1002/NET.3230190507},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ZeniosDM89.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-04-26 06:21 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:
