Search dblp for Publications

export results for "toc:db/journals/networks/networks80.bht:"

 download as .bib file

@article{DBLP:journals/networks/AlvarezCJ22,
  author       = {Aldair Alvarez and
                  Jean{-}Fran{\c{c}}ois Cordeau and
                  Raf Jans},
  title        = {The consistent production routing problem},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {356--381},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22112},
  doi          = {10.1002/NET.22112},
  timestamp    = {Thu, 29 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/AlvarezCJ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BarreraMMR22,
  author       = {Javiera Barrera and
                  Eduardo Moreno and
                  Gonzalo Mu{\~{n}}oz and
                  Pablo Romero},
  title        = {Exact reliability optimization for series-parallel graphs using convex
                  envelopes},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {235--248},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22089},
  doi          = {10.1002/NET.22089},
  timestamp    = {Fri, 12 Jul 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BarreraMMR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BernardinoGPS22,
  author       = {Raquel Bernardino and
                  Lu{\'{\i}}s Gouveia and
                  Ana Paias and
                  Daniel Santos},
  title        = {The multi-depot family traveling salesman problem and clustered variants:
                  Mathematical formulations and branch-{\&}-cut based methods},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {502--571},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22125},
  doi          = {10.1002/NET.22125},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BernardinoGPS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BertazziW22,
  author       = {Luca Bertazzi and
                  Xingyin Wang},
  title        = {Matheuristics with performance guarantee for the unsplit and split
                  delivery capacitated vehicle routing problem},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {482--501},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22115},
  doi          = {10.1002/NET.22115},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BertazziW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BlokhinBMP22,
  author       = {Yehor Blokhin and
                  Sergiy Butenko and
                  Petar Momcilovic and
                  Oleg A. Prokopyev},
  title        = {On maximum ratio clique relaxations},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {440--465},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22097},
  doi          = {10.1002/NET.22097},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/BlokhinBMP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BouchardLP22,
  author       = {S{\'{e}}bastien Bouchard and
                  Arnaud Labourel and
                  Andrzej Pelc},
  title        = {Impact of knowledge on the cost of treasure hunt in trees},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {51--62},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22075},
  doi          = {10.1002/NET.22075},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BouchardLP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BubboloniG22,
  author       = {Daniela Bubboloni and
                  Michele Gori},
  title        = {Paths and flows for centrality measures in networks},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {216--234},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22088},
  doi          = {10.1002/NET.22088},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BubboloniG22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BuchheimHH22,
  author       = {Christoph Buchheim and
                  Dorothee Henke and
                  Felix Hommelsheim},
  title        = {On the complexity of the bilevel minimum spanning tree problem},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {338--355},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22111},
  doi          = {10.1002/NET.22111},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BuchheimHH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/BujtasJT22,
  author       = {Csilla Bujt{\'{a}}s and
                  Marko Jakovac and
                  Zsolt Tuza},
  title        = {The k-path vertex cover: General bounds and chordal graphs},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {63--76},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22079},
  doi          = {10.1002/NET.22079},
  timestamp    = {Mon, 25 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BujtasJT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CarlssonJ22,
  author       = {John Gunnar Carlsson and
                  Bo Jones},
  title        = {Continuous approximation formulas for location problems},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {407--430},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22099},
  doi          = {10.1002/NET.22099},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CarlssonJ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CazzaroP22,
  author       = {Davide Cazzaro and
                  David Pisinger},
  title        = {Balanced cable routing for offshore wind farms with obstacles},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {386--406},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22100},
  doi          = {10.1002/NET.22100},
  timestamp    = {Thu, 05 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/CazzaroP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/CurryS22,
  author       = {Robert M. Curry and
                  J. Cole Smith},
  title        = {An augmenting-flow algorithm for a class of node-capacitated maximum
                  flow problems},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {109--122},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22082},
  doi          = {10.1002/NET.22082},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CurryS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/FortzGM22,
  author       = {Bernard Fortz and
                  Luis Gouveia and
                  Pedro Moura},
  title        = {A comparison of node-based and arc-based hop-indexed formulations
                  for the Steiner tree problem with hop constraints},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {178--192},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22086},
  doi          = {10.1002/NET.22086},
  timestamp    = {Thu, 31 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FortzGM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GoldenS22a,
  author       = {Bruce L. Golden and
                  Douglas R. Shier},
  title        = {Editorial: 2021 Glover-Klingman Prize Winner},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {151},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22113},
  doi          = {10.1002/NET.22113},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GoldenS22a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GoldenS22b,
  author       = {Bruce L. Golden and
                  Douglas R. Shier},
  title        = {Editorial},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {385},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22126},
  doi          = {10.1002/NET.22126},
  timestamp    = {Sat, 26 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/GoldenS22b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GrossKLS22,
  author       = {Daniel Gross and
                  Nathan Kahl and
                  Kristi Luttrell and
                  John T. Saccoman},
  title        = {Dr. Charles L. Suffel: Scholar, teacher, mentor, friend},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {431--439},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22098},
  doi          = {10.1002/NET.22098},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/GrossKLS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HassinP22,
  author       = {Refael Hassin and
                  Renata Poznanski},
  title        = {Integrality in the multinetwork min-cost equal-flow problem},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {267--273},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22094},
  doi          = {10.1002/NET.22094},
  timestamp    = {Mon, 24 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HassinP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HeBNS22,
  author       = {Edward He and
                  Natashia Boland and
                  George L. Nemhauser and
                  Martin W. P. Savelsbergh},
  title        = {An exact algorithm for the service network design problem with hub
                  capacity constraints},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {572--596},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22128},
  doi          = {10.1002/NET.22128},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/HeBNS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HosseiniW22,
  author       = {Seyed Soheil Hosseini and
                  Nick Wormald},
  title        = {Semi-labeled unrooted binary tree optimization subject to nonnegativity},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {249--263},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22090},
  doi          = {10.1002/NET.22090},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HosseiniW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/KosmasMSS22,
  author       = {Daniel Kosmas and
                  John E. Mitchell and
                  Thomas C. Sharkey and
                  Boleslaw K. Szymanski},
  title        = {Optimizing edge sets in networks to produce ground truth communities
                  based on modularity},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {152--177},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22084},
  doi          = {10.1002/NET.22084},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/KosmasMSS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/KrishnanL22,
  author       = {Devaraj Radha Krishnan and
                  Tieming Liu},
  title        = {A branch-and-cut algorithm for the pickup-and-delivery traveling salesman
                  problem with handling costs},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {297--313},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22096},
  doi          = {10.1002/NET.22096},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/KrishnanL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MartinezRV22,
  author       = {Mauro Mart{\'{\i}}nez and
                  Pablo Romero and
                  Julian Viera},
  title        = {A simple proof of the Gross-Saccoman multigraph conjecture},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {333--337},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22110},
  doi          = {10.1002/NET.22110},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/MartinezRV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MasonePG22,
  author       = {Adriano Masone and
                  Stefan Poikonen and
                  Bruce L. Golden},
  title        = {The multivisit drone routing problem with edge launches: An iterative
                  approach with discrete and continuous improvements},
  journal      = {Networks},
  volume       = {80},
  number       = {2},
  pages        = {193--215},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22087},
  doi          = {10.1002/NET.22087},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/MasonePG22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MikesellH22,
  author       = {Derek Mikesell and
                  Illya V. Hicks},
  title        = {Minimum k-cores and the k-core polytope},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {93--108},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22081},
  doi          = {10.1002/NET.22081},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/MikesellH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/MontenegroSV22,
  author       = {Bryan David Galarza Montenegro and
                  Kenneth S{\"{o}}rensen and
                  Pieter Vansteenwegen},
  title        = {A column generation algorithm for the demand-responsive feeder service
                  with mandatory and optional, clustered bus-stops},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {274--296},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22095},
  doi          = {10.1002/NET.22095},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/MontenegroSV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RastiV22,
  author       = {Saeid Rasti and
                  Chrysafis Vogiatzis},
  title        = {Novel centrality metrics for studying essentiality in protein-protein
                  interaction networks based on group structures},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {3--50},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22071},
  doi          = {10.1002/NET.22071},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RastiV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/RehfeldtFK22,
  author       = {Daniel Rehfeldt and
                  Henriette Franz and
                  Thorsten Koch},
  title        = {Optimal connected subgraphs: Integer programming formulations and
                  polyhedra},
  journal      = {Networks},
  volume       = {80},
  number       = {3},
  pages        = {314--332},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22101},
  doi          = {10.1002/NET.22101},
  timestamp    = {Mon, 24 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/RehfeldtFK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/Romero22,
  author       = {Pablo Romero},
  title        = {Uniformly optimally reliable graphs: {A} survey},
  journal      = {Networks},
  volume       = {80},
  number       = {4},
  pages        = {466--481},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22085},
  doi          = {10.1002/NET.22085},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Romero22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/VolzBRT22,
  author       = {Marcus Volz and
                  Marcus Brazil and
                  Charl J. Ras and
                  Doreen A. Thomas},
  title        = {Simplifying obstacles for Steiner network problems in the plane},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {77--92},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22080},
  doi          = {10.1002/NET.22080},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/VolzBRT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/XuH22,
  author       = {Liding Xu and
                  Sonia Haddad{-}Vanier},
  title        = {Branch-and-price for energy optimization in multi-hop wireless sensor
                  networks},
  journal      = {Networks},
  volume       = {80},
  number       = {1},
  pages        = {123--148},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22083},
  doi          = {10.1002/NET.22083},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/XuH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.