Остановите войну!
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 14 matches
- 2016
- Murodzhon Akhmedov, Ivo Kwee, Roberto Montemanni:
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem. Comput. Oper. Res. 70: 18-25 (2016) - Dirk Briskorn, Kurt Jørnsten, Philipp Zeise:
A pricing scheme for combinatorial auctions based on bundle sizes. Comput. Oper. Res. 70: 9-17 (2016) - George Dikas, Ioannis Minis:
Solving the bus evacuation problem and its variants. Comput. Oper. Res. 70: 75-86 (2016) - Tomás C. Gonçalves, Jorge M. S. Valente, Jeffrey E. Schaller:
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 70: 115-126 (2016) - Vahid Hajipour, Reza Zanjirani Farahani, Parviz Fattahi:
Bi-objective vibration damping optimization for congested location-pricing problem. Comput. Oper. Res. 70: 87-100 (2016) - Tiago Januario, Sebastián Urrutia:
A new neighborhood structure for round robin scheduling problems. Comput. Oper. Res. 70: 127-139 (2016) - Rui Borges Lopes, Carlos Ferreira, Beatriz Sousa Santos:
A simple and effective evolutionary algorithm for the capacitated location-routing problem. Comput. Oper. Res. 70: 155-162 (2016) - Geraldo Regis Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena, Gilbert Laporte:
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem. Comput. Oper. Res. 70: 140-154 (2016) - Janis Sebastian Neufeld, Jatinder N. D. Gupta, Udo Buscher:
A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70: 56-74 (2016) - Salvador Pineda, Juan M. Morales:
Capacity expansion of stochastic power generation under two-stage electricity markets. Comput. Oper. Res. 70: 101-114 (2016) - Kaarthik Sundar, Sivakumar Rathinam:
Generalized multiple depot traveling salesmen problem - Polyhedral study and exact algorithm. Comput. Oper. Res. 70: 39-55 (2016) - Matthias Walter, Jürgen Zimmermann:
Minimizing average project team size given multi-skilled workers with heterogeneous skill levels. Comput. Oper. Res. 70: 163-179 (2016) - Min Wen, Stefan Ropke, Hanne L. Petersen, Rune Larsen, Oli B. G. Madsen:
Full-shipload tramp ship routing and scheduling with variable speeds. Comput. Oper. Res. 70: 1-8 (2016) - Huili Zhang, Weitian Tong, Yinfeng Xu, Guohui Lin:
The Steiner traveling salesman problem with online advanced edge blockages. Comput. Oper. Res. 70: 26-38 (2016)
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-07-29 13:50 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