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/networks79.bht:"
download as .bib file
@article{DBLP:journals/networks/AbbaasV22,
author = {Omar Abbaas and
Jos{\'{e}} A. Ventura},
title = {An edge scanning method for the continuous deviation-flow refueling
station location problem on a general network},
journal = {Networks},
volume = {79},
number = {3},
pages = {264--291},
year = {2022},
url = {https://doi.org/10.1002/net.22032},
doi = {10.1002/NET.22032},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AbbaasV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AgarwalV22,
author = {Yogesh Kumar Agarwal and
Prahalad Venkateshan},
title = {New valid inequalities for the symmetric vehicle routing problem with
simultaneous pickup and deliveries},
journal = {Networks},
volume = {79},
number = {4},
pages = {537--556},
year = {2022},
url = {https://doi.org/10.1002/net.22069},
doi = {10.1002/NET.22069},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AgarwalV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AhmedC22,
author = {Maimoonah Ahmed and
Ben Cameron},
title = {The node cop-win reliability of unicyclic and bicyclic graphs},
journal = {Networks},
volume = {79},
number = {2},
pages = {189--201},
year = {2022},
url = {https://doi.org/10.1002/net.22055},
doi = {10.1002/NET.22055},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AhmedC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Al-NajjarBLE22,
author = {Yacine Al{-}Najjar and
Walid Ben{-}Ameur and
J{\'{e}}r{\'{e}}mie Leguay and
Jocelyne Elias},
title = {Affine routing for robust network design},
journal = {Networks},
volume = {79},
number = {4},
pages = {557--579},
year = {2022},
url = {https://doi.org/10.1002/net.22070},
doi = {10.1002/NET.22070},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Al-NajjarBLE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Arrieta-PrietoI22,
author = {Mario Arrieta{-}Prieto and
Abdelrahman Ismael and
Carlos Rivera{-}Gonzalez and
John E. Mitchell},
title = {Location of urban micro-consolidation centers to reduce the social
cost of last-mile deliveries of cargo: {A} heuristic approach},
journal = {Networks},
volume = {79},
number = {3},
pages = {292--313},
year = {2022},
url = {https://doi.org/10.1002/net.22076},
doi = {10.1002/NET.22076},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Arrieta-PrietoI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermanW22,
author = {Oded Berman and
Jiamin Wang},
title = {The multifacility center problems with random demand weights},
journal = {Networks},
volume = {79},
number = {4},
pages = {432--451},
year = {2022},
url = {https://doi.org/10.1002/net.22059},
doi = {10.1002/NET.22059},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermanW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BernardinoP22,
author = {Raquel Bernardino and
Ana Paias},
title = {The family traveling salesman problem with incompatibility constraints},
journal = {Networks},
volume = {79},
number = {1},
pages = {47--82},
year = {2022},
url = {https://doi.org/10.1002/net.22036},
doi = {10.1002/NET.22036},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BernardinoP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoyaciDL22,
author = {Burak Boyaci and
Thu Huong Dang and
Adam N. Letchford},
title = {On matchings, T-joins, and arc routing in road networks},
journal = {Networks},
volume = {79},
number = {1},
pages = {20--31},
year = {2022},
url = {https://doi.org/10.1002/net.22033},
doi = {10.1002/NET.22033},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoyaciDL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DragoiB22,
author = {Vlad{-}Florin Dragoi and
Valeriu Beiu},
title = {Fast reliability ranking of matchstick minimal networks},
journal = {Networks},
volume = {79},
number = {4},
pages = {479--500},
year = {2022},
url = {https://doi.org/10.1002/net.22064},
doi = {10.1002/NET.22064},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DragoiB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GhalamiG22,
author = {Laleh Ghalami and
Daniel Grosu},
title = {Approximation algorithms for Steiner forest: An experimental study},
journal = {Networks},
volume = {79},
number = {2},
pages = {164--188},
year = {2022},
url = {https://doi.org/10.1002/net.22046},
doi = {10.1002/NET.22046},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GhalamiG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenS22,
author = {Bruce L. Golden and
Douglas R. Shier},
title = {2019-2020 Glover-Klingman Prize Winners},
journal = {Networks},
volume = {79},
number = {4},
pages = {431},
year = {2022},
url = {https://doi.org/10.1002/net.22072},
doi = {10.1002/NET.22072},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GurevskyKKK22,
author = {Evgeny Gurevsky and
Dmitry Kopelevich and
Sergey Kovalev and
Mikhail Y. Kovalyov},
title = {Min-sum controllable risk problems with concave risk functions of
the same value range},
journal = {Networks},
volume = {79},
number = {1},
pages = {105--116},
year = {2022},
url = {https://doi.org/10.1002/net.22040},
doi = {10.1002/NET.22040},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GurevskyKKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HabeckP22,
author = {Oliver Habeck and
Marc E. Pfetsch},
title = {Combinatorial acyclicity models for potential-based flows},
journal = {Networks},
volume = {79},
number = {1},
pages = {83--104},
year = {2022},
url = {https://doi.org/10.1002/net.22038},
doi = {10.1002/NET.22038},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HabeckP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HaferkampE22,
author = {Jarmo Haferkamp and
Jan Fabian Ehmke},
title = {Effectiveness of demand and fulfillment control in dynamic fleet management
of ride-sharing systems},
journal = {Networks},
volume = {79},
number = {3},
pages = {314--337},
year = {2022},
url = {https://doi.org/10.1002/net.22062},
doi = {10.1002/NET.22062},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HaferkampE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hoppmann-Baum22,
author = {Kai Hoppmann{-}Baum},
title = {On the Complexity of Computing Maximum and Minimum Min-Cost-Flows},
journal = {Networks},
volume = {79},
number = {2},
pages = {236--248},
year = {2022},
url = {https://doi.org/10.1002/net.22060},
doi = {10.1002/NET.22060},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hoppmann-Baum22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KahveciogluM22,
author = {G{\"{o}}k{\c{c}}e Kahvecioglu and
David P. Morton},
title = {Optimal hierarchical clustering on a graph},
journal = {Networks},
volume = {79},
number = {2},
pages = {143--163},
year = {2022},
url = {https://doi.org/10.1002/net.22043},
doi = {10.1002/NET.22043},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KahveciogluM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KaspiRU22,
author = {Mor Kaspi and
Tal Raviv and
Marlin W. Ulmer},
title = {Preface: Special issue on the future of city logistics and urban mobility},
journal = {Networks},
volume = {79},
number = {3},
pages = {251--252},
year = {2022},
url = {https://doi.org/10.1002/net.22093},
doi = {10.1002/NET.22093},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KaspiRU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KaspiRU22a,
author = {Mor Kaspi and
Tal Raviv and
Marlin W. Ulmer},
title = {Directions for future research on urban mobility and city logistics},
journal = {Networks},
volume = {79},
number = {3},
pages = {253--263},
year = {2022},
url = {https://doi.org/10.1002/net.22092},
doi = {10.1002/NET.22092},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KaspiRU22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LeMSHS22,
author = {Do Duc Le and
Maximilian Merkert and
Stephan Sorgatz and
Mirko Hahn and
Sebastian Sager},
title = {Autonomous traffic at intersections: An optimization-based analysis
of possible time, energy, and {CO} savings},
journal = {Networks},
volume = {79},
number = {3},
pages = {338--363},
year = {2022},
url = {https://doi.org/10.1002/net.22078},
doi = {10.1002/NET.22078},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LeMSHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MacNeilB22,
author = {Moira MacNeil and
Merve Bodur},
title = {Constraint programming approaches for the discretizable molecular
distance geometry problem},
journal = {Networks},
volume = {79},
number = {4},
pages = {515--536},
year = {2022},
url = {https://doi.org/10.1002/net.22068},
doi = {10.1002/NET.22068},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MacNeilB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MargolisSM22,
author = {Joshua T. Margolis and
Yongjia Song and
Scott J. Mason},
title = {A multi-vehicle covering tour problem with speed optimization},
journal = {Networks},
volume = {79},
number = {2},
pages = {119--142},
year = {2022},
url = {https://doi.org/10.1002/net.22041},
doi = {10.1002/NET.22041},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MargolisSM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MartinsTJF22,
author = {Leandro do C. Martins and
Daniele Tarchi and
Angel A. Juan and
Alessandro Fusco},
title = {Agile optimization for a real-time facility location problem in Internet
of Vehicles networks},
journal = {Networks},
volume = {79},
number = {4},
pages = {501--514},
year = {2022},
url = {https://doi.org/10.1002/net.22067},
doi = {10.1002/NET.22067},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/MartinsTJF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OstermeierHH22,
author = {Manuel Ostermeier and
Andreas Heimfarth and
Alexander H. H{\"{u}}bner},
title = {Cost-optimal truck-and-robot routing for last-mile delivery},
journal = {Networks},
volume = {79},
number = {3},
pages = {364--389},
year = {2022},
url = {https://doi.org/10.1002/net.22030},
doi = {10.1002/NET.22030},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OstermeierHH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rosenfeld22,
author = {Ariel Rosenfeld},
title = {Optimal retrieval in puzzle-based storage with heuristic search and
tabulation},
journal = {Networks},
volume = {79},
number = {3},
pages = {390--402},
year = {2022},
url = {https://doi.org/10.1002/net.22066},
doi = {10.1002/NET.22066},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rosenfeld22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmithH22,
author = {Logan A. Smith and
Illya V. Hicks},
title = {New computational approaches for the power dominating set problem:
Set covering and the neighborhoods of zero forcing forts},
journal = {Networks},
volume = {79},
number = {2},
pages = {202--219},
year = {2022},
url = {https://doi.org/10.1002/net.22056},
doi = {10.1002/NET.22056},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SmithH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmithMH22,
author = {Logan A. Smith and
David T. Mildebrath and
Illya V. Hicks},
title = {An integer program and new lower bounds for computing the strong rainbow
connection numbers of graphs},
journal = {Networks},
volume = {79},
number = {1},
pages = {3--19},
year = {2022},
url = {https://doi.org/10.1002/net.22031},
doi = {10.1002/NET.22031},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SmithMH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Takazawa22,
author = {Kenjiro Takazawa},
title = {The b-bibranching problem: {TDI} system, packing, and discrete convexity},
journal = {Networks},
volume = {79},
number = {1},
pages = {32--46},
year = {2022},
url = {https://doi.org/10.1002/net.22035},
doi = {10.1002/NET.22035},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Takazawa22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TellezVLPM22,
author = {Oscar Tellez and
Samuel Vercraene and
Fabien Lehu{\'{e}}d{\'{e}} and
Olivier P{\'{e}}ton and
Thibaud Monteiro},
title = {The time-consistent dial-a-ride problem},
journal = {Networks},
volume = {79},
number = {4},
pages = {452--478},
year = {2022},
url = {https://doi.org/10.1002/net.22063},
doi = {10.1002/NET.22063},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TellezVLPM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Vaisman22,
author = {Radislav Vaisman},
title = {Finding minimum label spanning trees using cross-entropy method},
journal = {Networks},
volume = {79},
number = {2},
pages = {220--235},
year = {2022},
url = {https://doi.org/10.1002/net.22057},
doi = {10.1002/NET.22057},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Vaisman22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/VoigtK22,
author = {Stefan Voigt and
Heinrich Kuhn},
title = {Crowdsourced logistics: The pickup and delivery problem with transshipments
and occasional drivers},
journal = {Networks},
volume = {79},
number = {3},
pages = {403--426},
year = {2022},
url = {https://doi.org/10.1002/net.22045},
doi = {10.1002/NET.22045},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/VoigtK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/X22,
title = {{APPRECIATION} {TO} {REFEREES}},
journal = {Networks},
volume = {79},
number = {3},
pages = {427--428},
year = {2022},
url = {https://doi.org/10.1002/net.22091},
doi = {10.1002/NET.22091},
timestamp = {Thu, 21 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/X22.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-09-04 09:41 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:
