Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/networks/networks67.bht:"
@article{DBLP:journals/networks/Abu-AtaD16, author = {Muad Abu{-}Ata and Feodor F. Dragan}, title = {Metric tree-like structures in real-world networks: an empirical study}, journal = {Networks}, volume = {67}, number = {1}, pages = {49--68}, year = {2016}, url = {https://doi.org/10.1002/net.21631}, doi = {10.1002/NET.21631}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Abu-AtaD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/AringhieriGHS16, author = {Roberto Aringhieri and Andrea Grosso and Pierre Hosteins and Rosario Scatamacchia}, title = {Local search metaheuristics for the critical node problem}, journal = {Networks}, volume = {67}, number = {3}, pages = {209--221}, year = {2016}, url = {https://doi.org/10.1002/net.21671}, doi = {10.1002/NET.21671}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AringhieriGHS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/AtamturkGK16, author = {Alper Atamt{\"{u}}rk and Andr{\'{e}}s G{\'{o}}mez and Simge K{\"{u}}{\c{c}}{\"{u}}kyavuz}, title = {Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems}, journal = {Networks}, volume = {67}, number = {4}, pages = {299--315}, year = {2016}, url = {https://doi.org/10.1002/net.21677}, doi = {10.1002/NET.21677}, timestamp = {Wed, 08 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AtamturkGK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BartoliniBM16, author = {Enrico Bartolini and Lawrence Bodin and Aristide Mingozzi}, title = {The traveling salesman problem with pickup, delivery, and ride-time constraints}, journal = {Networks}, volume = {67}, number = {2}, pages = {95--110}, year = {2016}, url = {https://doi.org/10.1002/net.21663}, doi = {10.1002/NET.21663}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BartoliniBM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BoylesR16, author = {Stephen D. Boyles and Tarun Rambha}, title = {A note on detecting unbounded instances of the online shortest path problem}, journal = {Networks}, volume = {67}, number = {4}, pages = {270--276}, year = {2016}, url = {https://doi.org/10.1002/net.21670}, doi = {10.1002/NET.21670}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BoylesR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BrownC16, author = {Jason I. Brown and Danielle Cox}, title = {Inflection points of reliability polynomials are dense in [0, 1]}, journal = {Networks}, volume = {67}, number = {4}, pages = {266--269}, year = {2016}, url = {https://doi.org/10.1002/net.21669}, doi = {10.1002/NET.21669}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BrownC16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CorteS16, author = {Annelies De Corte and Kenneth S{\"{o}}rensen}, title = {An iterated local search algorithm for water distribution network design optimization}, journal = {Networks}, volume = {67}, number = {3}, pages = {187--198}, year = {2016}, url = {https://doi.org/10.1002/net.21673}, doi = {10.1002/NET.21673}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/CorteS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DiarrassoubaGMG16, author = {I. Diarrassouba and Virginie Gabrel and Ali Ridha Mahjoub and Luis Eduardo Neves Gouveia and Pierre Pesneau}, title = {Integer programming formulations for the \emph{k}-edge-connected 3-hop-constrained network design problem}, journal = {Networks}, volume = {67}, number = {2}, pages = {148--169}, year = {2016}, url = {https://doi.org/10.1002/net.21667}, doi = {10.1002/NET.21667}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DiarrassoubaGMG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DiarrassoubaKM16, author = {Ibrahima Diarrassouba and Hakan Kutucu and Ali Ridha Mahjoub}, title = {Two node-disjoint hop-constrained survivable network design and polyhedra}, journal = {Networks}, volume = {67}, number = {4}, pages = {316--337}, year = {2016}, url = {https://doi.org/10.1002/net.21679}, doi = {10.1002/NET.21679}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DiarrassoubaKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/EspanesRRRRU16, author = {Pablo Moisset de Espan{\'{e}}s and Ivan Rapaport and Daniel Remenik and Javiera Urrutia}, title = {Robust reconstruction of Barab{\'{a}}si-Albert networks in the broadcast congested clique model}, journal = {Networks}, volume = {67}, number = {1}, pages = {82--91}, year = {2016}, url = {https://doi.org/10.1002/net.21662}, doi = {10.1002/NET.21662}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/EspanesRRRRU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GoldenS16, author = {Bruce L. Golden and Douglas R. Shier}, title = {Editorial: 2015 Glover-Klingman Prize Winners}, journal = {Networks}, volume = {67}, number = {4}, pages = {265}, year = {2016}, url = {https://doi.org/10.1002/net.21681}, doi = {10.1002/NET.21681}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GoldenS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/HaahrL16, author = {J{\o}rgen Thorlund Haahr and Richard Martin Lusby}, title = {A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards}, journal = {Networks}, volume = {67}, number = {2}, pages = {126--138}, year = {2016}, url = {https://doi.org/10.1002/net.21665}, doi = {10.1002/NET.21665}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/HaahrL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/HillV16, author = {Alessandro Hill and Stefan Vo{\ss}}, title = {An equi-model matheuristic for the multi-depot ring star problem}, journal = {Networks}, volume = {67}, number = {3}, pages = {222--237}, year = {2016}, url = {https://doi.org/10.1002/net.21674}, doi = {10.1002/NET.21674}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/HillV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Kahruman-Anderoglu16, author = {Sera Kahruman{-}Anderoglu and Austin Buchanan and Sergiy Butenko and Oleg A. Prokopyev}, title = {On provably best construction heuristics for hard combinatorial optimization problems}, journal = {Networks}, volume = {67}, number = {3}, pages = {238--245}, year = {2016}, url = {https://doi.org/10.1002/net.21620}, doi = {10.1002/NET.21620}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/Kahruman-Anderoglu16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KincaidKLP16, author = {Rex K. Kincaid and Sarah J. Kunkler and Michael Drew Lamar and David Phillips}, title = {Algorithms and complexity results for finding graphs with extremal Randi{\'{c}} index}, journal = {Networks}, volume = {67}, number = {4}, pages = {338--347}, year = {2016}, url = {https://doi.org/10.1002/net.21680}, doi = {10.1002/NET.21680}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/KincaidKLP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KochenbergerG16, author = {Gary A. Kochenberger and Fred W. Glover}, title = {Preface}, journal = {Networks}, volume = {67}, number = {3}, pages = {185--186}, year = {2016}, url = {https://doi.org/10.1002/net.21678}, doi = {10.1002/NET.21678}, timestamp = {Tue, 04 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/KochenbergerG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/LariRPS16, author = {Isabella Lari and Federica Ricca and Justo Puerto and Andrea Scozzari}, title = {Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria}, journal = {Networks}, volume = {67}, number = {1}, pages = {69--81}, year = {2016}, url = {https://doi.org/10.1002/net.21661}, doi = {10.1002/NET.21661}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/LariRPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MatsuiS16, author = {Tomomi Matsui and Rudolf Scheifele}, title = {A linear time algorithm for the unbalanced Hitchcock transportation problem}, journal = {Networks}, volume = {67}, number = {2}, pages = {170--182}, year = {2016}, url = {https://doi.org/10.1002/net.21668}, doi = {10.1002/NET.21668}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MatsuiS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Medal16, author = {Hugh R. Medal}, title = {The wireless network jamming problem subject to protocol interference}, journal = {Networks}, volume = {67}, number = {2}, pages = {111--125}, year = {2016}, url = {https://doi.org/10.1002/net.21664}, doi = {10.1002/NET.21664}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Medal16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MladenovicVBJA16, author = {Snezana Mladenovic and Slavko Veskovic and Irina Branovic and Sladjana Jankovic and Slavisa Acimovic}, title = {Heuristic Based Real-Time Train Rescheduling System}, journal = {Networks}, volume = {67}, number = {1}, pages = {32--48}, year = {2016}, url = {https://doi.org/10.1002/net.21625}, doi = {10.1002/NET.21625}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MladenovicVBJA16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/PsaraftisWK16, author = {Harilaos N. Psaraftis and Min Wen and Christos A. Kontovas}, title = {Dynamic vehicle routing problems: Three decades and counting}, journal = {Networks}, volume = {67}, number = {1}, pages = {3--31}, year = {2016}, url = {https://doi.org/10.1002/net.21628}, doi = {10.1002/NET.21628}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/PsaraftisWK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/RespenZA16, author = {Jean Respen and Nicolas Zufferey and Edoardo Amaldi}, title = {Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry}, journal = {Networks}, volume = {67}, number = {3}, pages = {246--261}, year = {2016}, url = {https://doi.org/10.1002/net.21656}, doi = {10.1002/NET.21656}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/RespenZA16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ShabtaiR16, author = {Revital Hollander Shabtai and Yehuda Roditty}, title = {Line-broadcasting in complete \emph{k}-ary trees}, journal = {Networks}, volume = {67}, number = {2}, pages = {139--147}, year = {2016}, url = {https://doi.org/10.1002/net.21666}, doi = {10.1002/NET.21666}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ShabtaiR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/VaskoLKTJP16, author = {Francis J. Vasko and Eric Landquist and Gregory Kresge and Adam Tal and Yifeng Jiang and Xenophon Papademetris}, title = {A simple and efficient strategy for solving very large-scale generalized cable-trench problems}, journal = {Networks}, volume = {67}, number = {3}, pages = {199--208}, year = {2016}, url = {https://doi.org/10.1002/net.21614}, doi = {10.1002/NET.21614}, timestamp = {Tue, 18 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/VaskoLKTJP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/VignacVJ16, author = {Benoit Vignac and Fran{\c{c}}ois Vanderbeck and Brigitte Jaumard}, title = {Reformulation and decomposition approaches for traffic routing in optical networks}, journal = {Networks}, volume = {67}, number = {4}, pages = {277--298}, year = {2016}, url = {https://doi.org/10.1002/net.21672}, doi = {10.1002/NET.21672}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/VignacVJ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.