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/networks77.bht:"
download as .bib file
@article{DBLP:journals/networks/AgatzHT21,
author = {Niels A. H. Agatz and
Mike Hewitt and
Barrett W. Thomas},
title = {"Make no little plans": Impactful research to solve the next generation
of transportation problems},
journal = {Networks},
volume = {77},
number = {2},
pages = {269--286},
year = {2021},
url = {https://doi.org/10.1002/net.22002},
doi = {10.1002/NET.22002},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AgatzHT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AnapolskaBCK21,
author = {Mariia Anapolska and
Christina B{\"{u}}sing and
Martin Comis and
Tabea Krabs},
title = {Minimum color-degree perfect b-matchings},
journal = {Networks},
volume = {77},
number = {4},
pages = {477--494},
year = {2021},
url = {https://doi.org/10.1002/net.21974},
doi = {10.1002/NET.21974},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AnapolskaBCK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ArchettiB21,
author = {Claudia Archetti and
Luca Bertazzi},
title = {Recent challenges in Routing and Inventory Routing: E-commerce and
last-mile delivery},
journal = {Networks},
volume = {77},
number = {2},
pages = {255--268},
year = {2021},
url = {https://doi.org/10.1002/net.21995},
doi = {10.1002/NET.21995},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ArchettiB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BarnetsonBEHPR21,
author = {Kathleen D. Barnetson and
Andrea C. Burgess and
Jessica A. Enright and
Jared Howell and
David A. Pike and
Brady Ryan},
title = {The firebreak problem},
journal = {Networks},
volume = {77},
number = {3},
pages = {372--382},
year = {2021},
url = {https://doi.org/10.1002/net.21975},
doi = {10.1002/NET.21975},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BarnetsonBEHPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BarrGHK21,
author = {Richard S. Barr and
Fred W. Glover and
Toby Huskinson and
Gary A. Kochenberger},
title = {An extreme-point tabu-search algorithm for fixed-charge network problems},
journal = {Networks},
volume = {77},
number = {2},
pages = {322--340},
year = {2021},
url = {https://doi.org/10.1002/net.22020},
doi = {10.1002/NET.22020},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BarrGHK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownCCGM21,
author = {Jason I. Brown and
Charles J. Colbourn and
Danielle Cox and
Christina Graves and
Lucas Mol},
title = {Network reliability: Heading out on the highway},
journal = {Networks},
volume = {77},
number = {1},
pages = {146--160},
year = {2021},
url = {https://doi.org/10.1002/net.21977},
doi = {10.1002/NET.21977},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BrownCCGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CambierCFOP21,
author = {Adrien Cambier and
Matthieu Chardy and
Rosa Figueiredo and
Adam Ouorou and
Michael Poss},
title = {Optimizing the investments in mobile networks and subscriber migrations
for a telecommunication operator},
journal = {Networks},
volume = {77},
number = {4},
pages = {495--519},
year = {2021},
url = {https://doi.org/10.1002/net.21970},
doi = {10.1002/NET.21970},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CambierCFOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CorberanEHPS21,
author = {{\'{A}}ngel Corber{\'{a}}n and
Richard Eglese and
Geir Hasle and
Isaac Plana and
Jos{\'{e}} Mar{\'{\i}}a Sanchis},
title = {Arc routing problems: {A} review of the past, present, and future},
journal = {Networks},
volume = {77},
number = {1},
pages = {88--115},
year = {2021},
url = {https://doi.org/10.1002/net.21965},
doi = {10.1002/NET.21965},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CorberanEHPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DucoffeD21,
author = {Guillaume Ducoffe and
Feodor F. Dragan},
title = {A story of diameter, radius, and (almost) Helly property},
journal = {Networks},
volume = {77},
number = {3},
pages = {435--453},
year = {2021},
url = {https://doi.org/10.1002/net.21998},
doi = {10.1002/NET.21998},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DucoffeD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FortzGBL21,
author = {Bernard Fortz and
Luis Gouveia and
Christina B{\"{u}}sing and
Markus Leitner},
title = {Preface: Special issue on network analytics and optimization},
journal = {Networks},
volume = {77},
number = {4},
pages = {475--476},
year = {2021},
url = {https://doi.org/10.1002/net.22039},
doi = {10.1002/NET.22039},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FortzGBL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FridmanKPR21,
author = {Ilia Fridman and
Mikhail Y. Kovalyov and
Erwin Pesch and
Andrew Ryzhikov},
title = {Fixed interval scheduling with third-party machines},
journal = {Networks},
volume = {77},
number = {3},
pages = {361--371},
year = {2021},
url = {https://doi.org/10.1002/net.21973},
doi = {10.1002/NET.21973},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FridmanKPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Frisch21,
author = {Ivan T. Frisch},
title = {The Early Days of Networks},
journal = {Networks},
volume = {77},
number = {1},
pages = {14--20},
year = {2021},
url = {https://doi.org/10.1002/net.21927},
doi = {10.1002/NET.21927},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Frisch21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenS21,
author = {Bruce L. Golden and
Douglas R. Shier},
title = {Twenty-one years in the life of Networks {(2000} to 2020)},
journal = {Networks},
volume = {77},
number = {1},
pages = {5--13},
year = {2021},
url = {https://doi.org/10.1002/net.21986},
doi = {10.1002/NET.21986},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/GoldenS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GudapatiMM21,
author = {Naga Venkata C. Gudapati and
Enrico Malaguti and
Michele Monaci},
title = {In search of dense subgraphs: How good is greedy peeling?},
journal = {Networks},
volume = {77},
number = {4},
pages = {572--586},
year = {2021},
url = {https://doi.org/10.1002/net.22034},
doi = {10.1002/NET.22034},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GudapatiMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HasanH21,
author = {Mohd. Hafiz Hasan and
Pascal Van Hentenryck},
title = {Large-scale zone-based evacuation planning - Part {I:} Models and
algorithms},
journal = {Networks},
volume = {77},
number = {1},
pages = {127--145},
year = {2021},
url = {https://doi.org/10.1002/net.21981},
doi = {10.1002/NET.21981},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HasanH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HasanH21a,
author = {Mohd. Hafiz Hasan and
Pascal Van Hentenryck},
title = {Large-scale zone-based evacuation planning, Part {II:} Macroscopic
and microscopic evaluations},
journal = {Networks},
volume = {77},
number = {2},
pages = {341--358},
year = {2021},
url = {https://doi.org/10.1002/net.21980},
doi = {10.1002/NET.21980},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HasanH21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HicksB21,
author = {Illya V. Hicks and
Boris Brimkov},
title = {Tangle bases: Revisited},
journal = {Networks},
volume = {77},
number = {1},
pages = {161--172},
year = {2021},
url = {https://doi.org/10.1002/net.21979},
doi = {10.1002/NET.21979},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HicksB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum21,
author = {Dorit S. Hochbaum},
title = {Applications and efficient algorithms for integer programming problems
on monotone constraints},
journal = {Networks},
volume = {77},
number = {1},
pages = {21--49},
year = {2021},
url = {https://doi.org/10.1002/net.21983},
doi = {10.1002/NET.21983},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HoeferW21,
author = {Martin Hoefer and
Lisa Wilhelmi},
title = {Packing returning secretaries},
journal = {Networks},
volume = {77},
number = {3},
pages = {454--471},
year = {2021},
url = {https://doi.org/10.1002/net.22000},
doi = {10.1002/NET.22000},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HoeferW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LenardaGR21,
author = {Pietro Lenarda and
Giorgio Gnecco and
Massimo Riccaboni},
title = {Parameter estimation in a 3-parameter p-star random graph model},
journal = {Networks},
volume = {77},
number = {3},
pages = {403--420},
year = {2021},
url = {https://doi.org/10.1002/net.21992},
doi = {10.1002/NET.21992},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LenardaGR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ljubic21,
author = {Ivana Ljubic},
title = {Solving Steiner trees: Recent advances, challenges, and perspectives},
journal = {Networks},
volume = {77},
number = {2},
pages = {177--204},
year = {2021},
url = {https://doi.org/10.1002/net.22005},
doi = {10.1002/NET.22005},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ljubic21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MarcianoALSFF21,
author = {Carlos E. Marciano and
Gladstone M. Arantes Jr. and
Abilio Lucena and
Luidi Gelabert Simonetti and
Lu{\'{e}}rbio Faria and
Felipe M. G. Fran{\c{c}}a},
title = {Optimizing concurrency under Scheduling by Edge Reversal},
journal = {Networks},
volume = {77},
number = {4},
pages = {520--537},
year = {2021},
url = {https://doi.org/10.1002/net.22014},
doi = {10.1002/NET.22014},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MarcianoALSFF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MeloFS21,
author = {Alexsander Andrade de Melo and
Celina M. H. de Figueiredo and
U{\'{e}}verton dos Santos Souza},
title = {On undirected two-commodity integral flow, disjoint paths and strict
terminal connection problems},
journal = {Networks},
volume = {77},
number = {4},
pages = {559--571},
year = {2021},
url = {https://doi.org/10.1002/net.21976},
doi = {10.1002/NET.21976},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MeloFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Nagurney21,
author = {Anna Nagurney},
title = {Networks in economics and finance in Networks and beyond: {A} half
century retrospective},
journal = {Networks},
volume = {77},
number = {1},
pages = {50--65},
year = {2021},
url = {https://doi.org/10.1002/net.21920},
doi = {10.1002/NET.21920},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/Nagurney21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OmerP21,
author = {J{\'{e}}r{\'{e}}my Omer and
Michael Poss},
title = {A polynomial algorithm for minimizing travel time in consistent time-dependent
networks with waits},
journal = {Networks},
volume = {77},
number = {3},
pages = {421--434},
year = {2021},
url = {https://doi.org/10.1002/net.21994},
doi = {10.1002/NET.21994},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OmerP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrlinG21,
author = {James B. Orlin and
Xiao{-}Yue Gong},
title = {A fast maximum flow algorithm},
journal = {Networks},
volume = {77},
number = {2},
pages = {287--321},
year = {2021},
url = {https://doi.org/10.1002/net.22001},
doi = {10.1002/NET.22001},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrlinG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OudjitS21,
author = {Aissa Oudjit and
Matthias F. Stallmann},
title = {Efficient algorithms for finding 2-medians of a tree},
journal = {Networks},
volume = {77},
number = {3},
pages = {383--402},
year = {2021},
url = {https://doi.org/10.1002/net.21978},
doi = {10.1002/NET.21978},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OudjitS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PoikonenC21,
author = {Stefan Poikonen and
James F. Campbell},
title = {Future directions in drone routing research},
journal = {Networks},
volume = {77},
number = {1},
pages = {116--126},
year = {2021},
url = {https://doi.org/10.1002/net.21982},
doi = {10.1002/NET.21982},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/PoikonenC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RaghavanS21,
author = {S. Raghavan and
J. Cole Smith},
title = {Preface},
journal = {Networks},
volume = {77},
number = {1},
pages = {3--4},
year = {2021},
url = {https://doi.org/10.1002/net.22011},
doi = {10.1002/NET.22011},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/RaghavanS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RaghavanS21a,
author = {S. Raghavan and
J. Cole Smith},
title = {Preface},
journal = {Networks},
volume = {77},
number = {2},
pages = {175--176},
year = {2021},
url = {https://doi.org/10.1002/net.22025},
doi = {10.1002/NET.22025},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RaghavanS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RaghavanZ21,
author = {S. Raghavan and
Rui Zhang},
title = {Weighted target set selection on trees and cycles},
journal = {Networks},
volume = {77},
number = {4},
pages = {587--609},
year = {2021},
url = {https://doi.org/10.1002/net.21972},
doi = {10.1002/NET.21972},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RaghavanZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SharkeyPEA21,
author = {Thomas C. Sharkey and
Sarah G. Nurre Pinkley and
Daniel A. Eisenberg and
David L. Alderson},
title = {In search of network resilience: An optimization-based view},
journal = {Networks},
volume = {77},
number = {2},
pages = {225--254},
year = {2021},
url = {https://doi.org/10.1002/net.21996},
doi = {10.1002/NET.21996},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SharkeyPEA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TomaszewskiPSFC21,
author = {Artur Tomaszewski and
Michal Pi{\'{o}}ro and
Davide Sanvito and
Ilario Filippini and
Antonio Capone},
title = {An efficient approach to optimization of semi-stable routing in multicommodity
flow networks},
journal = {Networks},
volume = {77},
number = {4},
pages = {538--558},
year = {2021},
url = {https://doi.org/10.1002/net.21999},
doi = {10.1002/NET.21999},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TomaszewskiPSFC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangW21,
author = {Xingyin Wang and
Edward A. Wasil},
title = {On the road to better routes: Five decades of published research on
the vehicle routing problem},
journal = {Networks},
volume = {77},
number = {1},
pages = {66--87},
year = {2021},
url = {https://doi.org/10.1002/net.21942},
doi = {10.1002/NET.21942},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/WangW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Wong21,
author = {Richard T. Wong},
title = {Telecommunications network design: Technology impacts and future directions},
journal = {Networks},
volume = {77},
number = {2},
pages = {205--224},
year = {2021},
url = {https://doi.org/10.1002/net.21997},
doi = {10.1002/NET.21997},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Wong21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/X21a,
title = {{APPRECIATION} {TO} {REFEREES}},
journal = {Networks},
volume = {77},
number = {4},
pages = {610--611},
year = {2021},
url = {https://doi.org/10.1002/net.22037},
doi = {10.1002/NET.22037},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/X21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/X21,
title = {Retracted: {A} novel pseudo-polynomial approach for shortest paths
problems},
journal = {Networks},
volume = {77},
number = {3},
pages = {472},
year = {2021},
note = {Withdrawn.},
url = {https://doi.org/10.1002/net.21966},
doi = {10.1002/NET.21966},
timestamp = {Mon, 07 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/X21.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-02 20:01 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:
