default search action
Search dblp for Publications
export results for "toc:db/journals/networks/networks63.bht:"
@article{DBLP:journals/networks/AraghiBA14, author = {Mojtaba Araghi and Oded Berman and Igor Averbakh}, title = {Minisum multipurpose trip location problem on trees}, journal = {Networks}, volume = {63}, number = {2}, pages = {154--159}, year = {2014}, url = {https://doi.org/10.1002/net.21531}, doi = {10.1002/NET.21531}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AraghiBA14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ArchettiBSH14, author = {Claudia Archetti and Nicola Bianchessi and Maria Grazia Speranza and Alain Hertz}, title = {The split delivery capacitated team orienteering problem}, journal = {Networks}, volume = {63}, number = {1}, pages = {16--33}, year = {2014}, url = {https://doi.org/10.1002/net.21519}, doi = {10.1002/NET.21519}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ArchettiBSH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ArchettiBSH14a, author = {Claudia Archetti and Nicola Bianchessi and Maria Grazia Speranza and Alain Hertz}, title = {Incomplete service and split deliveries in a routing problem with profits}, journal = {Networks}, volume = {63}, number = {2}, pages = {135--145}, year = {2014}, url = {https://doi.org/10.1002/net.21529}, doi = {10.1002/NET.21529}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ArchettiBSH14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/AverbakhBKKN14, author = {Igor Averbakh and Oded Berman and Dmitry Krass and J{\"{o}}rg Kalcsics and Stefan Nickel}, title = {Cooperative covering problems on networks}, journal = {Networks}, volume = {63}, number = {4}, pages = {334--349}, year = {2014}, url = {https://doi.org/10.1002/net.21549}, doi = {10.1002/NET.21549}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AverbakhBKKN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BenaventCDLPS14, author = {Enrique Benavent and Angel Corber{\'{a}}n and Guy Desaulniers and Fran{\c{c}}ois Lessard and Isaac Plana and Jos{\'{e}} M. Sanchis}, title = {A branch-price-and-cut algorithm for the min-max \emph{k}-vehicle windy rural postman problem}, journal = {Networks}, volume = {63}, number = {1}, pages = {34--45}, year = {2014}, url = {https://doi.org/10.1002/net.21520}, doi = {10.1002/NET.21520}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BenaventCDLPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BergerGZ14, author = {Andr{\'{e}} Berger and Alexander Grigoriev and Ruben van der Zwaan}, title = {Complexity and approximability of the \emph{k}-way vertex cut}, journal = {Networks}, volume = {63}, number = {2}, pages = {170--178}, year = {2014}, url = {https://doi.org/10.1002/net.21534}, doi = {10.1002/NET.21534}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BergerGZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BolandKKK14, author = {Natashia Boland and Reena Kapoor and Simranjit Kaur and Thomas Kalinowski}, title = {Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results}, journal = {Networks}, volume = {63}, number = {2}, pages = {196--202}, year = {2014}, url = {https://doi.org/10.1002/net.21536}, doi = {10.1002/NET.21536}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BolandKKK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BorosHHM14, author = {Endre Boros and Pinar Heggernes and Pim van 't Hof and Martin Milanic}, title = {Vector connectivity in graphs}, journal = {Networks}, volume = {63}, number = {4}, pages = {277--285}, year = {2014}, url = {https://doi.org/10.1002/net.21545}, doi = {10.1002/NET.21545}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BorosHHM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BrownC14, author = {Jason I. Brown and Danielle Cox}, title = {Nonexistence of optimal graphs for all terminal reliability}, journal = {Networks}, volume = {63}, number = {2}, pages = {146--153}, year = {2014}, url = {https://doi.org/10.1002/net.21530}, doi = {10.1002/NET.21530}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BrownC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CampbellW14, author = {Ann Melissa Campbell and Jill Hardin Wilson}, title = {Forty years of periodic vehicle routing}, journal = {Networks}, volume = {63}, number = {1}, pages = {2--15}, year = {2014}, url = {https://doi.org/10.1002/net.21527}, doi = {10.1002/NET.21527}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/CampbellW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CampbellW14a, author = {Ann Melissa Campbell and Jill Hardin Wilson}, title = {Forty years of periodic vehicle routing}, journal = {Networks}, volume = {63}, number = {3}, pages = {276}, year = {2014}, url = {https://doi.org/10.1002/net.21544}, doi = {10.1002/NET.21544}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/CampbellW14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DAngeloDF14, author = {Gianlorenzo D'Angelo and Mattia D'Emidio and Daniele Frigioni}, title = {Fully dynamic update of arc-flags}, journal = {Networks}, volume = {63}, number = {3}, pages = {243--259}, year = {2014}, url = {https://doi.org/10.1002/net.21542}, doi = {10.1002/NET.21542}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DAngeloDF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Drexl14, author = {Michael Drexl}, title = {Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments}, journal = {Networks}, volume = {63}, number = {1}, pages = {119--133}, year = {2014}, url = {https://doi.org/10.1002/net.21526}, doi = {10.1002/NET.21526}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Drexl14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FeilletGLPQ14, author = {Dominique Feillet and Thierry Garaix and Fabien Lehu{\'{e}}d{\'{e}} and Olivier P{\'{e}}ton and Dominique Quadri}, title = {A new consistent vehicle routing problem for the transportation of people with disabilities}, journal = {Networks}, volume = {63}, number = {3}, pages = {211--224}, year = {2014}, url = {https://doi.org/10.1002/net.21538}, doi = {10.1002/NET.21538}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FeilletGLPQ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GollowitzerGLPW14, author = {Stefan Gollowitzer and Luis Eduardo Neves Gouveia and Gilbert Laporte and Dilson Lucas Pereira and Adam Wojciechowski}, title = {A comparison of several models for the hamiltonian \emph{p}-median problem}, journal = {Networks}, volume = {63}, number = {4}, pages = {350--363}, year = {2014}, url = {https://doi.org/10.1002/net.21550}, doi = {10.1002/NET.21550}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GollowitzerGLPW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/HaBLR14, author = {Minh Ho{\`{a}}ng H{\`{a}} and Nathalie Bostel and Andr{\'{e}} Langevin and Louis{-}Martin Rousseau}, title = {Solving the close-enough arc routing problem}, journal = {Networks}, volume = {63}, number = {1}, pages = {107--118}, year = {2014}, url = {https://doi.org/10.1002/net.21525}, doi = {10.1002/NET.21525}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/HaBLR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Hernandez-PerezG14, author = {Hip{\'{o}}lito Hern{\'{a}}ndez{-}P{\'{e}}rez and Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez}, title = {The multi-commodity pickup-and-delivery traveling salesman problem}, journal = {Networks}, volume = {63}, number = {1}, pages = {46--59}, year = {2014}, url = {https://doi.org/10.1002/net.21521}, doi = {10.1002/NET.21521}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Hernandez-PerezG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KimBPTDKS14, author = {In{-}Jae Kim and Brian P. Barthel and Yuyoung Park and Jordan R. Tait and Joseph L. Dobmeier and Sung Kim and Dooyoung Shin}, title = {Network analysis for active and passive propagation models}, journal = {Networks}, volume = {63}, number = {2}, pages = {160--169}, year = {2014}, url = {https://doi.org/10.1002/net.21532}, doi = {10.1002/NET.21532}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/KimBPTDKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KobayashiO14, author = {Masayuki Kobayashi and Yoshio Okamoto}, title = {Submodularity of minimum-cost spanning tree games}, journal = {Networks}, volume = {63}, number = {3}, pages = {231--238}, year = {2014}, url = {https://doi.org/10.1002/net.21540}, doi = {10.1002/NET.21540}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/KobayashiO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KovacsPHP14, author = {Attila A. Kovacs and Sophie N. Parragh and Richard F. Hartl}, title = {A template-based adaptive large neighborhood search for the consistent vehicle routing problem}, journal = {Networks}, volume = {63}, number = {1}, pages = {60--81}, year = {2014}, url = {https://doi.org/10.1002/net.21522}, doi = {10.1002/NET.21522}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/KovacsPHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/LiX14, author = {Xiang{-}Jun Li and Jun{-}Ming Xu}, title = {Generalized measures for fault tolerance of star networks}, journal = {Networks}, volume = {63}, number = {3}, pages = {225--230}, year = {2014}, url = {https://doi.org/10.1002/net.21539}, doi = {10.1002/NET.21539}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/LiX14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MoradiLH14, author = {Ahmad Moradi and Andrea Lodi and S. Mehdi Hashemi}, title = {On the difficulty of virtual private network instances}, journal = {Networks}, volume = {63}, number = {4}, pages = {327--333}, year = {2014}, url = {https://doi.org/10.1002/net.21548}, doi = {10.1002/NET.21548}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/MoradiLH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/NolzAF14, author = {Pamela C. Nolz and Nabil Absi and Dominique Feillet}, title = {A stochastic inventory routing problem for infectious medical waste collection}, journal = {Networks}, volume = {63}, number = {1}, pages = {82--95}, year = {2014}, url = {https://doi.org/10.1002/net.21523}, doi = {10.1002/NET.21523}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/NolzAF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/NurreS14, author = {Sarah G. Nurre and Thomas C. Sharkey}, title = {Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules}, journal = {Networks}, volume = {63}, number = {4}, pages = {306--326}, year = {2014}, url = {https://doi.org/10.1002/net.21547}, doi = {10.1002/NET.21547}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/NurreS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/OliveiraB14, author = {Fabiano de S. Oliveira and Valmir Carneiro Barbosa}, title = {Revisiting deadlock prevention: {A} probabilistic approach}, journal = {Networks}, volume = {63}, number = {2}, pages = {203--210}, year = {2014}, url = {https://doi.org/10.1002/net.21537}, doi = {10.1002/NET.21537}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/OliveiraB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/QianE14, author = {Jiani Qian and Richard W. Eglese}, title = {Finding least fuel emission paths in a network with time-varying speeds}, journal = {Networks}, volume = {63}, number = {1}, pages = {96--106}, year = {2014}, url = {https://doi.org/10.1002/net.21524}, doi = {10.1002/NET.21524}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/QianE14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/SmithS14, author = {Olivia J. Smith and Martin W. P. Savelsbergh}, title = {A note on shortest path problems with forbidden paths}, journal = {Networks}, volume = {63}, number = {3}, pages = {239--242}, year = {2014}, url = {https://doi.org/10.1002/net.21541}, doi = {10.1002/NET.21541}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/SmithS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/VermaC14, author = {Amit Verma and Ann Melissa Campbell}, title = {Strategic placement of telemetry to reduce routing costs}, journal = {Networks}, volume = {63}, number = {3}, pages = {260--275}, year = {2014}, url = {https://doi.org/10.1002/net.21543}, doi = {10.1002/NET.21543}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/VermaC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Xie14, author = {Chi Xie}, title = {Bicriterion discrete equilibrium network design problem}, journal = {Networks}, volume = {63}, number = {4}, pages = {286--305}, year = {2014}, url = {https://doi.org/10.1002/net.21546}, doi = {10.1002/NET.21546}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Xie14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/XuLLW14, author = {Zhou Xu and Xiaofan Lai and Andrew Lim and Fan Wang}, title = {An improved approximation algorithm for the capacitated {TSP} with pickup and delivery on a tree}, journal = {Networks}, volume = {63}, number = {2}, pages = {179--195}, year = {2014}, url = {https://doi.org/10.1002/net.21535}, doi = {10.1002/NET.21535}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/XuLLW14.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.