Остановите войну!
for scientists:
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 56 matches
- 1989
- Yogesh Agarwal, Kamlesh Mathur, Harvey M. Salkin:
A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19(7): 731-749 (1989) - Edward J. Anderson, Andrew B. Philpott:
A continuous-time network simplex algorithm. Networks 19(4): 395-425 (1989) - Anantharam Balakrishnan, Stephen C. Graves:
A composite algorithm for a concave-cost network flow problem. Networks 19(2): 175-202 (1989) - Egon Balas:
The prize collecting traveling salesman problem. Networks 19(6): 621-636 (1989) - Egon Balas, Chang Sung Yu:
On graphs with polynomially solvable maximum-weight clique problem. Networks 19(2): 247-253 (1989) - Rajan Batta, Oded Berman:
A location model for a facility operating as an M/G/k queue. Networks 19(6): 717-728 (1989) - John E. Beasley:
An SST-based algorithm for the steiner problem in graphs. Networks 19(1): 1-16 (1989) - John E. Beasley, Nicos Christofides:
An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989) - Daniel Bienstock, Clyde L. Monma:
Optimal enclosing regions in planar graphs. Networks 19(1): 79-94 (1989) - Timothy B. Brecht, Charles J. Colbourn:
Multiplicative improvements in network reliability bounds. Networks 19(5): 521-529 (1989) - James E. Burns:
The maximum independent set problem for cubic planar graphs. Networks 19(3): 373-378 (1989) - Guo-Ray Cai, Yu-Geng Sun:
The minimum augmentation of any graph to a K-edge-connected graph. Networks 19(1): 151-172 (1989) - Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth:
A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5): 531-548 (1989) - Lynne L. Doty:
Extremal connectivity and vulnerability in graphs. Networks 19(1): 73-78 (1989) - C. W. Duin, A. Volgenant:
Reduction tests for the steiner problem in grapsh. Networks 19(5): 549-567 (1989) - Abdel Aziz Farrag, Robert J. Dawson:
Designing optimal fault-tolerant star networks. Networks 19(6): 707-716 (1989) - Odile Favaron, Mekkia Kouider, Maryvonne Mahéo:
Edge-vulnerability and mean distance. Networks 19(5): 493-504 (1989) - Amos Fiat, Adi Shamir:
How to find a battleship. Networks 19(3): 361-371 (1989) - Art S. Finbow, Bert L. Hartnell:
On designing a network to defend against random attacks of radius two. Networks 19(7): 771-792 (1989) - Luisa Gargano, Ugo Vaccaro:
On the construction of minimal broadcast networks. Networks 19(6): 673-689 (1989) - Edgar N. Gilbert:
A solvable routing problem. Networks 19(5): 587-594 (1989) - Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Some properties of 2-threshold graphs. Networks 19(1): 17-23 (1989) - Pierre Hansen, Martine Labbé:
The continuous p-median of a network. Networks 19(5): 595-606 (1989) - Marcia P. Helme, Thomas L. Magnanti:
Designing satellite communication networks by zero - one quadratic programming. Networks 19(4): 427-450 (1989) - George R. T. Hendry:
On mean distance in certain classes of graphs. Networks 19(4): 451-457 (1989) - Dorit S. Hochbaum, Arie Segev:
Analysis of a flow problem with fixed charges. Networks 19(3): 291-312 (1989) - John N. Hooker:
Solving nonlinear multiple-facility network location problems. Networks 19(1): 117-133 (1989) - Arne Bang Huseby:
Domination theory and the crapo β-invariant. Networks 19(1): 135-149 (1989) - Anjani Jain:
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks. Networks 19(7): 793-801 (1989) - R. Johnson, M. G. Pilcher:
The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 pp. Networks 19(5): 615-616 (1989)
skipping 26 more matches
loading more results
failed to load more results, please try again later
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-05-06 18:56 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