Остановите войну!
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 16 matches
- 2017
- Claudio Arbib, Mara Servilio, Paolo Ventura:
An improved integer linear programming formulation for the closest 0-1 string problem. Comput. Oper. Res. 80: 94-100 (2017) - T. C. van Barneveld, Robert D. van der Mei, Sandjai Bhulai:
Compliance tables for an EMS system with two types of medical response units. Comput. Oper. Res. 80: 68-81 (2017) - Sonia Cafieri, David Rey:
Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming. Comput. Oper. Res. 80: 147-158 (2017) - Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
An exact approach for the 0-1 knapsack problem with setups. Comput. Oper. Res. 80: 61-67 (2017) - Wei-Wei Cui, Zhiqiang Lu:
Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates. Comput. Oper. Res. 80: 11-22 (2017) - Majid Eskandarpour, Pierre Dejax, Olivier Péton:
A large neighborhood search heuristic for supply chain network design. Comput. Oper. Res. 80: 23-37 (2017) - Wen Jiao, Ju-Liang Zhang, Hong Yan:
The stochastic lot-sizing problem with quantity discounts. Comput. Oper. Res. 80: 1-10 (2017) - Francisco López-Ramos, Esteve Codina, Ángel Marín, Armando Guarnaschelli:
Integrated approach to network design and frequency setting problem in railway rapid transit systems. Comput. Oper. Res. 80: 128-146 (2017) - Quan-Ke Pan, Rubén Ruiz, Pedro Alfaro-Fernández:
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Comput. Oper. Res. 80: 50-60 (2017) - Tom Pape:
Value of agreement in decision analysis: Concept, measures and application. Comput. Oper. Res. 80: 82-93 (2017) - N. Rafiee Parsa, Behrooz Karimi, S. M. Moattar Husseini:
Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system. Comput. Oper. Res. 80: 173-183 (2017) - Breno Piva, Cid C. de Souza:
Minimum stabbing rectangular partitions of rectilinear polygons. Comput. Oper. Res. 80: 184-197 (2017) - Frédéric Quesnel, Guy Desaulniers, François Soumis:
A new heuristic branching scheme for the crew pairing problem with base constraints. Comput. Oper. Res. 80: 159-172 (2017) - Aykut Melih Turhan, Bilge Bilgen:
Mixed integer programming based heuristics for the Patient Admission Scheduling problem. Comput. Oper. Res. 80: 38-49 (2017) - Lijun Wei, Qian Hu, Stephen C. H. Leung, Ning Zhang:
An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput. Oper. Res. 80: 113-127 (2017) - Muh-Cherng Wu, Chi-Shiuan Lin, Chia-Hui Lin, Chen-Fu Chen:
Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems. Comput. Oper. Res. 80: 101-112 (2017)
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-06-29 22:59 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