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
Impact of knowledge on the cost of treasure hunt in trees. 51-62 - Csilla Bujtás
The k-path vertex cover: General bounds and chordal graphs. 63-76 - Marcus Volz, Marcus Brazil, Charl J. Ras
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
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
Editorial: 2021 Glover-Klingman Prize Winner. 151
- Daniel Kosmas
Optimizing edge sets in networks to produce ground truth communities based on modularity. 152-177
- Bernard Fortz
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. 178-192
- Adriano Masone
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements. 193-215 - Daniela Bubboloni
Paths and flows for centrality measures in networks. 216-234 - Javiera Barrera
Exact reliability optimization for series-parallel graphs using convex envelopes. 235-248 - Seyed Soheil Hosseini
Semi-labeled unrooted binary tree optimization subject to nonnegativity. 249-263
Volume 80, Number 3, October 2022
- Refael Hassin
Integrality in the multinetwork min-cost equal-flow problem. 267-273 - Bryan David Galarza Montenegro
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
Optimal connected subgraphs: Integer programming formulations and polyhedra. 314-332 - Mauro Martínez, Pablo Romero
A simple proof of the Gross-Saccoman multigraph conjecture. 333-337 - Christoph Buchheim, Dorothee Henke
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
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend. 431-439
- Yehor Blokhin, Sergiy Butenko
On maximum ratio clique relaxations. 440-465
- Pablo Romero
Uniformly optimally reliable graphs: A survey. 466-481
- Luca Bertazzi
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. 482-501 - Raquel Bernardino
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. 502-571 - Edward He
An exact algorithm for the service network design problem with hub capacity constraints. 572-596
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.
last updated on 2024-11-22 19:32 CET 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: