![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Networks, Volume 80
Volume 80, Number 1, July 2022
- Saeid Rasti, Chrysafis Vogiatzis
:
Novel centrality metrics for studying essentiality in protein-protein interaction networks based on group structures. 3-50 - Sébastien Bouchard, Arnaud Labourel
, Andrzej Pelc
:
Impact of knowledge on the cost of treasure hunt in trees. 51-62 - Csilla Bujtás
, Marko Jakovac
, Zsolt Tuza
:
The k-path vertex cover: General bounds and chordal graphs. 63-76 - Marcus Volz, Marcus Brazil, Charl J. Ras
, Doreen A. Thomas:
Simplifying obstacles for Steiner network problems in the plane. 77-92 - Derek Mikesell, Illya V. Hicks
:
Minimum k-cores and the k-core polytope. 93-108 - Robert M. Curry
, J. Cole Smith
:
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems. 109-122 - Liding Xu, Sonia Haddad-Vanier
:
Branch-and-price for energy optimization in multi-hop wireless sensor networks. 123-148
Volume 80, Number 2, September 2022
- Bruce L. Golden
, Douglas R. Shier
:
Editorial: 2021 Glover-Klingman Prize Winner. 151
- Daniel Kosmas
, John E. Mitchell
, Thomas C. Sharkey
, Boleslaw K. Szymanski
:
Optimizing edge sets in networks to produce ground truth communities based on modularity. 152-177
- Bernard Fortz
, Luis Gouveia
, Pedro Moura
:
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. 178-192
- Adriano Masone
, Stefan Poikonen
, Bruce L. Golden
:
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements. 193-215 - Daniela Bubboloni
, Michele Gori
:
Paths and flows for centrality measures in networks. 216-234 - Javiera Barrera
, Eduardo Moreno
, Gonzalo Muñoz
, Pablo Romero
:
Exact reliability optimization for series-parallel graphs using convex envelopes. 235-248 - Seyed Soheil Hosseini
, Nick Wormald:
Semi-labeled unrooted binary tree optimization subject to nonnegativity. 249-263
Volume 80, Number 3, October 2022
- Refael Hassin
, Renata Poznanski:
Integrality in the multinetwork min-cost equal-flow problem. 267-273 - Bryan David Galarza Montenegro
, Kenneth Sörensen, Pieter Vansteenwegen:
A column generation algorithm for the demand-responsive feeder service with mandatory and optional, clustered bus-stops. 274-296 - Devaraj Radha Krishnan, Tieming Liu
:
A branch-and-cut algorithm for the pickup-and-delivery traveling salesman problem with handling costs. 297-313 - Daniel Rehfeldt
, Henriette Franz, Thorsten Koch
:
Optimal connected subgraphs: Integer programming formulations and polyhedra. 314-332 - Mauro Martínez, Pablo Romero
, Julian Viera:
A simple proof of the Gross-Saccoman multigraph conjecture. 333-337 - Christoph Buchheim, Dorothee Henke
, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. 338-355 - Aldair Alvarez, Jean-François Cordeau, Raf Jans:
The consistent production routing problem. 356-381
Volume 80, Number 4, December 2022
- Bruce L. Golden, Douglas R. Shier:
Editorial. 385
- Davide Cazzaro, David Pisinger
:
Balanced cable routing for offshore wind farms with obstacles. 386-406 - John Gunnar Carlsson, Bo Jones:
Continuous approximation formulas for location problems. 407-430
- Daniel Gross, Nathan Kahl, Kristi Luttrell
, John T. Saccoman:
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend. 431-439
- Yehor Blokhin, Sergiy Butenko
, Petar Momcilovic
, Oleg A. Prokopyev
:
On maximum ratio clique relaxations. 440-465
- Pablo Romero
:
Uniformly optimally reliable graphs: A survey. 466-481
- Luca Bertazzi
, Xingyin Wang
:
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. 482-501 - Raquel Bernardino
, Luís Gouveia
, Ana Paias
, Daniel Santos
:
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. 502-571 - Edward He
, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
An exact algorithm for the service network design problem with hub capacity constraints. 572-596
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.