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/networks12.bht:"
download as .bib file
@article{DBLP:journals/networks/BazaraaS82,
author = {Mokhtar S. Bazaraa and
Hanif D. Sherali},
title = {A property regarding degenerate pivots for linear assignment networks},
journal = {Networks},
volume = {12},
number = {4},
pages = {469--474},
year = {1982},
url = {https://doi.org/10.1002/net.3230120411},
doi = {10.1002/NET.3230120411},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BazaraaS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermanO82,
author = {Oded Berman and
Amedeo R. Odoni},
title = {Locating mobile servers on a network with markovian properties},
journal = {Networks},
volume = {12},
number = {1},
pages = {73--86},
year = {1982},
url = {https://doi.org/10.1002/net.3230120106},
doi = {10.1002/NET.3230120106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermanO82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoeschS82,
author = {Francis T. Boesch and
Charles L. Suffel},
title = {Realizability of \emph{p}-point, \emph{q}-line graphs with prescribed
point connectivity, line connectivity, or minimum degree},
journal = {Networks},
volume = {12},
number = {3},
pages = {341--350},
year = {1982},
url = {https://doi.org/10.1002/net.3230120311},
doi = {10.1002/NET.3230120311},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoeschS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenG82,
author = {Chih{-}Kang Eric Chen and
Robert S. Garfinkel},
title = {The generalized diameter of a graph},
journal = {Networks},
volume = {12},
number = {3},
pages = {335--340},
year = {1982},
url = {https://doi.org/10.1002/net.3230120310},
doi = {10.1002/NET.3230120310},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChenG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CutlerR82,
author = {M. Cutler and
Z. Riesel},
title = {Minimum width 2-layer layout of a multichanneled system},
journal = {Networks},
volume = {12},
number = {2},
pages = {173--189},
year = {1982},
url = {https://doi.org/10.1002/net.3230120208},
doi = {10.1002/NET.3230120208},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CutlerR82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Dafermos82,
author = {Stella Dafermos},
title = {The general multimodal network equilibrium problem with elastic demand},
journal = {Networks},
volume = {12},
number = {1},
pages = {57--72},
year = {1982},
url = {https://doi.org/10.1002/net.3230120105},
doi = {10.1002/NET.3230120105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Dafermos82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Erickson82,
author = {Ranel E. Erickson},
title = {Generalizations of planar graphs},
journal = {Networks},
volume = {12},
number = {2},
pages = {127--140},
year = {1982},
url = {https://doi.org/10.1002/net.3230120205},
doi = {10.1002/NET.3230120205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Erickson82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Exoo82,
author = {Geoffrey Exoo},
title = {On a measure of communication network vulnerability},
journal = {Networks},
volume = {12},
number = {4},
pages = {405--409},
year = {1982},
url = {https://doi.org/10.1002/net.3230120405},
doi = {10.1002/NET.3230120405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Exoo82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FarleyP82,
author = {Arthur M. Farley and
Andrzej Proskurowski},
title = {Networks immune to isolated line failures},
journal = {Networks},
volume = {12},
number = {4},
pages = {393--403},
year = {1982},
url = {https://doi.org/10.1002/net.3230120404},
doi = {10.1002/NET.3230120404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FarleyP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FrankG82,
author = {Ove Frank and
Wolfgang Gaul},
title = {On reliability in stochastic graphs},
journal = {Networks},
volume = {12},
number = {2},
pages = {119--126},
year = {1982},
url = {https://doi.org/10.1002/net.3230120204},
doi = {10.1002/NET.3230120204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FrankG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FriezeGM82,
author = {Alan M. Frieze and
Giulia Galbiati and
Francesco Maffioli},
title = {On the worst-case performance of some algorithms for the asymmetric
traveling salesman problem},
journal = {Networks},
volume = {12},
number = {1},
pages = {23--39},
year = {1982},
url = {https://doi.org/10.1002/net.3230120103},
doi = {10.1002/NET.3230120103},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/FriezeGM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gavish82,
author = {Bezalel Gavish},
title = {Topological design of centralized computer networks - formulations
and algorithms},
journal = {Networks},
volume = {12},
number = {4},
pages = {355--377},
year = {1982},
url = {https://doi.org/10.1002/net.3230120402},
doi = {10.1002/NET.3230120402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gavish82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Griggs82,
author = {Jerrold R. Griggs},
title = {Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385
pp. Price: {\textdollar}23.95},
journal = {Networks},
volume = {12},
number = {4},
pages = {507--508},
year = {1982},
url = {https://doi.org/10.1002/net.3230120416},
doi = {10.1002/NET.3230120416},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Griggs82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GuptaLL82,
author = {Udaiprakash I. Gupta and
D. T. Lee and
Joseph Y.{-}T. Leung},
title = {Efficient algorithms for interval graphs and circular-arc graphs},
journal = {Networks},
volume = {12},
number = {4},
pages = {459--467},
year = {1982},
url = {https://doi.org/10.1002/net.3230120410},
doi = {10.1002/NET.3230120410},
timestamp = {Mon, 05 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GuptaLL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hamacher82,
author = {Horst W. Hamacher},
title = {Determining minimal cuts with a minimal number of arcs},
journal = {Networks},
volume = {12},
number = {4},
pages = {493--504},
year = {1982},
url = {https://doi.org/10.1002/net.3230120413},
doi = {10.1002/NET.3230120413},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hamacher82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HararyLZ82,
author = {Frank Harary and
Bernt Lindstr{\"{o}}m and
Hans{-}olov Zetterstr{\"{o}}m},
title = {On balance in group graphs},
journal = {Networks},
volume = {12},
number = {3},
pages = {317--321},
year = {1982},
url = {https://doi.org/10.1002/net.3230120308},
doi = {10.1002/NET.3230120308},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HararyLZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hassin82,
author = {Refael Hassin},
title = {Minimum cost flow with set-constraints},
journal = {Networks},
volume = {12},
number = {1},
pages = {1--21},
year = {1982},
url = {https://doi.org/10.1002/net.3230120102},
doi = {10.1002/NET.3230120102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hassin82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ItaiPS82,
author = {Alon Itai and
Yehoshua Perl and
Yossi Shiloach},
title = {The complexity of finding maximum disjoint paths with length constraints},
journal = {Networks},
volume = {12},
number = {3},
pages = {277--286},
year = {1982},
url = {https://doi.org/10.1002/net.3230120306},
doi = {10.1002/NET.3230120306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ItaiPS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JarvisT82,
author = {John J. Jarvis and
S{\"{u}}leyman T{\"{u}}fekci},
title = {A decomposition algorithm for locating a shortest path between two
nodes in a network},
journal = {Networks},
volume = {12},
number = {2},
pages = {161--172},
year = {1982},
url = {https://doi.org/10.1002/net.3230120207},
doi = {10.1002/NET.3230120207},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/JarvisT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KatohIM82,
author = {Naoki Katoh and
Toshihide Ibaraki and
Hisashi Mine},
title = {An efficient algorithm for {K} shortest simple paths},
journal = {Networks},
volume = {12},
number = {4},
pages = {411--427},
year = {1982},
url = {https://doi.org/10.1002/net.3230120406},
doi = {10.1002/NET.3230120406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KatohIM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Kaufman82,
author = {Ronald Kaufman},
title = {Communications network analysis, by Howard Cravis, Lexington Books,
Lexington, MA, 1981, 144pp. Price not given},
journal = {Networks},
volume = {12},
number = {4},
pages = {505},
year = {1982},
url = {https://doi.org/10.1002/net.3230120414},
doi = {10.1002/NET.3230120414},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Kaufman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Klincewicz82,
author = {John G. Klincewicz},
title = {Algorithms for Network Programming, by J. L. Kennington and R. V.
Helgason, Wiley, New York, 1980, 291 pp. Price: {\textdollar}25.00},
journal = {Networks},
volume = {12},
number = {1},
pages = {87--88},
year = {1982},
url = {https://doi.org/10.1002/net.3230120107},
doi = {10.1002/NET.3230120107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Klincewicz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KwanT82,
author = {C. L. Kwan and
S. Toida},
title = {An optimal 2-FT realization of binary symmetric hierarchical tree
systems},
journal = {Networks},
volume = {12},
number = {3},
pages = {231--239},
year = {1982},
url = {https://doi.org/10.1002/net.3230120303},
doi = {10.1002/NET.3230120303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KwanT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MartelloT82,
author = {Silvano Martello and
Paolo Toth},
title = {Finding a minimum equivalent graph of a digraph},
journal = {Networks},
volume = {12},
number = {2},
pages = {89--100},
year = {1982},
url = {https://doi.org/10.1002/net.3230120202},
doi = {10.1002/NET.3230120202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MartelloT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Monma82,
author = {Clyde L. Monma},
title = {Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley
and Sons, Inc., New York, 1980, 408 pp. Price: {\textdollar}28.95},
journal = {Networks},
volume = {12},
number = {3},
pages = {351},
year = {1982},
url = {https://doi.org/10.1002/net.3230120312},
doi = {10.1002/NET.3230120312},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Monma82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MurtyP82,
author = {Katta G. Murty and
Clovis Perin},
title = {A 1-matching blossom-type algorithm for edge covering problems},
journal = {Networks},
volume = {12},
number = {4},
pages = {379--391},
year = {1982},
url = {https://doi.org/10.1002/net.3230120403},
doi = {10.1002/NET.3230120403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MurtyP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PicardQ82,
author = {Jean{-}Claude Picard and
Maurice Queyranne},
title = {A network flow solution to some nonlinear 0-1 programming problems,
with applications to graph theory},
journal = {Networks},
volume = {12},
number = {2},
pages = {141--159},
year = {1982},
url = {https://doi.org/10.1002/net.3230120206},
doi = {10.1002/NET.3230120206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PicardQ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rosenberg82,
author = {Eric Rosenberg},
title = {Optimization: Theory and applications, by {S} . {S} . Rao, Wiley Eastern
Limited, New Delhi, 1979, 711 pp. Price: {\textdollar}21.95},
journal = {Networks},
volume = {12},
number = {3},
pages = {352--353},
year = {1982},
url = {https://doi.org/10.1002/net.3230120313},
doi = {10.1002/NET.3230120313},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rosenberg82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RotemU82,
author = {Doron Rotem and
Jorge Urrutia},
title = {Circular permutation graphs},
journal = {Networks},
volume = {12},
number = {4},
pages = {429--437},
year = {1982},
url = {https://doi.org/10.1002/net.3230120407},
doi = {10.1002/NET.3230120407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RotemU82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RoweM82,
author = {Harrison E. Rowe and
Wanda L. Mammel},
title = {Counting formulas for tree growth plans},
journal = {Networks},
volume = {12},
number = {1},
pages = {41--56},
year = {1982},
url = {https://doi.org/10.1002/net.3230120104},
doi = {10.1002/NET.3230120104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RoweM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SchmidtJB82,
author = {Stephen R. Schmidt and
Paul A. Jensen and
J. Wesley Barnes},
title = {An advanced dual incremental network algorithm},
journal = {Networks},
volume = {12},
number = {4},
pages = {475--492},
year = {1982},
url = {https://doi.org/10.1002/net.3230120412},
doi = {10.1002/NET.3230120412},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SchmidtJB82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Segall82,
author = {Adrian Segall},
title = {Decentralized maximum-flow protocols},
journal = {Networks},
volume = {12},
number = {3},
pages = {213--230},
year = {1982},
url = {https://doi.org/10.1002/net.3230120302},
doi = {10.1002/NET.3230120302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Segall82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SheffiP82,
author = {Yosef Sheffi and
Warren B. Powell},
title = {An algorithm for the equilibrium assignment problem with random link
times},
journal = {Networks},
volume = {12},
number = {2},
pages = {191--207},
year = {1982},
url = {https://doi.org/10.1002/net.3230120209},
doi = {10.1002/NET.3230120209},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SheffiP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Shogan82,
author = {Andrew W. Shogan},
title = {Modular decomposition and reliability computation in stochastic transportation
networks having cutnodes},
journal = {Networks},
volume = {12},
number = {3},
pages = {255--275},
year = {1982},
url = {https://doi.org/10.1002/net.3230120305},
doi = {10.1002/NET.3230120305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Shogan82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShoreFG82,
author = {M. L. Shore and
Leslie R. Foulds and
Peter B. Gibbons},
title = {An algorithm for the steiner problem in graphs},
journal = {Networks},
volume = {12},
number = {3},
pages = {323--333},
year = {1982},
url = {https://doi.org/10.1002/net.3230120309},
doi = {10.1002/NET.3230120309},
timestamp = {Mon, 28 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShoreFG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Somers82,
author = {J. E. Somers},
title = {Maximum flow in networks with a small number of random arc capacities},
journal = {Networks},
volume = {12},
number = {3},
pages = {241--253},
year = {1982},
url = {https://doi.org/10.1002/net.3230120304},
doi = {10.1002/NET.3230120304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Somers82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Steihaug82,
author = {Trond Steihaug},
title = {Practical methods of optimization volume 1 : Unconstrained optimization,
by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: {\textdollar}24.50},
journal = {Networks},
volume = {12},
number = {4},
pages = {508--509},
year = {1982},
url = {https://doi.org/10.1002/net.3230120417},
doi = {10.1002/NET.3230120417},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Steihaug82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TsukiyamaK82,
author = {Shuji Tsukiyama and
Ernest S. Kuh},
title = {Double-row planar routing and permutation layout},
journal = {Networks},
volume = {12},
number = {3},
pages = {287--316},
year = {1982},
url = {https://doi.org/10.1002/net.3230120307},
doi = {10.1002/NET.3230120307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TsukiyamaK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TuckerZ82,
author = {Alan C. Tucker and
Armen H. Zemanian},
title = {A matroid related to finitely chainlike, countably infinite networks},
journal = {Networks},
volume = {12},
number = {4},
pages = {453--457},
year = {1982},
url = {https://doi.org/10.1002/net.3230120409},
doi = {10.1002/NET.3230120409},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TuckerZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Yorkiewicz82,
author = {Jack Yorkiewicz},
title = {Optimality in nonlinear programming: {A} feasible directions approach,
by A. Ben-Israel, A. Ben-Td, and S. Zlobec, Wiley, New York, 1981,
144 pp. Price: {\textdollar}21.95},
journal = {Networks},
volume = {12},
number = {4},
pages = {506--507},
year = {1982},
url = {https://doi.org/10.1002/net.3230120415},
doi = {10.1002/NET.3230120415},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Yorkiewicz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Zemel82,
author = {Eitan Zemel},
title = {Polynomial algorithms for estimating network reliability},
journal = {Networks},
volume = {12},
number = {4},
pages = {439--452},
year = {1982},
url = {https://doi.org/10.1002/net.3230120408},
doi = {10.1002/NET.3230120408},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Zemel82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Zipkin82,
author = {Paul H. Zipkin},
title = {Aggregation and disaggregation in convex network problems},
journal = {Networks},
volume = {12},
number = {2},
pages = {101--117},
year = {1982},
url = {https://doi.org/10.1002/net.3230120203},
doi = {10.1002/NET.3230120203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Zipkin82.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-20 12:14 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:
