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 17 matches
- 2020
- Ernesto G. Birgin, João Eduardo Ferreira, Débora P. Ronconi:
A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Comput. Oper. Res. 114 (2020) - Erdi Dasdemir, Murat Köksalan, Diclehan Tezcaner Öztürk:
A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem. Comput. Oper. Res. 114 (2020) - Mauro Dell'Amico, Fabio Furini, Manuel Iori:
A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114 (2020) - Marko Djukanovic, Günther R. Raidl, Christian Blum:
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020) - Asefe Forghani, Farzad Dehghanian, Majid Salari, Yousef Ghiami:
A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities. Comput. Oper. Res. 114 (2020) - Fabian Gnegel, Armin Fügenschuh:
An iterative graph expansion approach for the scheduling and routing of airplanes. Comput. Oper. Res. 114 (2020) - Julia Grübel, Thomas Kleinert, Vanessa Krebs, Galina Orlinskaya, Lars Schewe, Martin Schmidt, Johannes Thürauf:
On electricity market equilibria with storage: Modeling, uniqueness, and a distributed ADMM. Comput. Oper. Res. 114 (2020) - Lieke M. van der Heide, Leandro C. Coelho, Iris F. A. Vis, Roel G. van Anholt:
Replenishment and denomination mix of automated teller machines with dynamic forecast demands. Comput. Oper. Res. 114 (2020) - M. K. Marichelvam, M. Geetha, Ömür Tosun:
An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - A case study. Comput. Oper. Res. 114 (2020) - Guillaume Marquès, Ruslan Sadykov, Jean-Christophe Deschamps, Rémy Dupas:
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114 (2020) - Md Sarowar Morshed, Md. Noor-E-Alam:
Generalized affine scaling algorithms for linear programming problems. Comput. Oper. Res. 114 (2020) - Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí:
Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114 (2020) - Efrat Perel, Nir Perel, Uri Yechiali:
A polling system with 'Join the shortest - serve the longest' policy. Comput. Oper. Res. 114 (2020) - José Miguel Quesada Pérez, Jean-Sébastien Tancrez, Jean-Charles Lange:
Express shipment service network design with complex routes. Comput. Oper. Res. 114 (2020) - David Rodríguez Rueda, Carlos Cotta, Antonio José Fernández Leiva:
Memetic collaborative approaches for finding balanced incomplete block designs. Comput. Oper. Res. 114 (2020) - Lohic Fotio Tiotsop, Antonio Servetti, Enrico Masala:
An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision. Comput. Oper. Res. 114 (2020) - Dmitrii Usanov, Peter M. van de Ven, Rob D. van der Mei:
Dispatching fire trucks under stochastic driving times. Comput. Oper. Res. 114 (2020)
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-12-24 12:06 CET 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