![](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
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2022
- Aldair Alvarez, Jean-François Cordeau, Raf Jans:
The consistent production routing problem. Networks 80(3): 356-381 (2022) - Javiera Barrera
, Eduardo Moreno
, Gonzalo Muñoz
, Pablo Romero
:
Exact reliability optimization for series-parallel graphs using convex envelopes. Networks 80(2): 235-248 (2022) - 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. Networks 80(4): 502-571 (2022) - Luca Bertazzi
, Xingyin Wang
:
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. Networks 80(4): 482-501 (2022) - Yehor Blokhin, Sergiy Butenko
, Petar Momcilovic
, Oleg A. Prokopyev
:
On maximum ratio clique relaxations. Networks 80(4): 440-465 (2022) - Sébastien Bouchard, Arnaud Labourel
, Andrzej Pelc
:
Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1): 51-62 (2022) - Daniela Bubboloni
, Michele Gori
:
Paths and flows for centrality measures in networks. Networks 80(2): 216-234 (2022) - Christoph Buchheim, Dorothee Henke
, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022) - Csilla Bujtás
, Marko Jakovac
, Zsolt Tuza
:
The k-path vertex cover: General bounds and chordal graphs. Networks 80(1): 63-76 (2022) - John Gunnar Carlsson, Bo Jones:
Continuous approximation formulas for location problems. Networks 80(4): 407-430 (2022) - Davide Cazzaro, David Pisinger
:
Balanced cable routing for offshore wind farms with obstacles. Networks 80(4): 386-406 (2022) - Robert M. Curry
, J. Cole Smith
:
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems. Networks 80(1): 109-122 (2022) - 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. Networks 80(2): 178-192 (2022) - Bruce L. Golden
, Douglas R. Shier
:
Editorial: 2021 Glover-Klingman Prize Winner. Networks 80(2): 151 (2022) - Bruce L. Golden, Douglas R. Shier:
Editorial. Networks 80(4): 385 (2022) - Daniel Gross, Nathan Kahl, Kristi Luttrell
, John T. Saccoman:
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend. Networks 80(4): 431-439 (2022) - Refael Hassin
, Renata Poznanski:
Integrality in the multinetwork min-cost equal-flow problem. Networks 80(3): 267-273 (2022) - Edward He
, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
An exact algorithm for the service network design problem with hub capacity constraints. Networks 80(4): 572-596 (2022) - Seyed Soheil Hosseini
, Nick Wormald:
Semi-labeled unrooted binary tree optimization subject to nonnegativity. Networks 80(2): 249-263 (2022) - Daniel Kosmas
, John E. Mitchell
, Thomas C. Sharkey
, Boleslaw K. Szymanski
:
Optimizing edge sets in networks to produce ground truth communities based on modularity. Networks 80(2): 152-177 (2022) - Devaraj Radha Krishnan, Tieming Liu
:
A branch-and-cut algorithm for the pickup-and-delivery traveling salesman problem with handling costs. Networks 80(3): 297-313 (2022) - Mauro Martínez, Pablo Romero
, Julian Viera:
A simple proof of the Gross-Saccoman multigraph conjecture. Networks 80(3): 333-337 (2022) - Adriano Masone
, Stefan Poikonen
, Bruce L. Golden
:
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements. Networks 80(2): 193-215 (2022) - Derek Mikesell, Illya V. Hicks
:
Minimum k-cores and the k-core polytope. Networks 80(1): 93-108 (2022) - 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. Networks 80(3): 274-296 (2022) - Saeid Rasti, Chrysafis Vogiatzis
:
Novel centrality metrics for studying essentiality in protein-protein interaction networks based on group structures. Networks 80(1): 3-50 (2022) - Daniel Rehfeldt
, Henriette Franz, Thorsten Koch
:
Optimal connected subgraphs: Integer programming formulations and polyhedra. Networks 80(3): 314-332 (2022) - Pablo Romero
:
Uniformly optimally reliable graphs: A survey. Networks 80(4): 466-481 (2022) - Marcus Volz, Marcus Brazil, Charl J. Ras
, Doreen A. Thomas:
Simplifying obstacles for Steiner network problems in the plane. Networks 80(1): 77-92 (2022) - Liding Xu, Sonia Haddad-Vanier
:
Branch-and-price for energy optimization in multi-hop wireless sensor networks. Networks 80(1): 123-148 (2022)
loading more results
failed to load more results, please try again later
![](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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-23 13:39 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