default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 13 matches
- 2019
- Lavinia Amorosi
, Paolo Dell'Olmo, Giovanni Luca Giacco:
Mathematical Models for On-Line Train Calendars Generation. Comput. Oper. Res. 102: 1-9 (2019) - Víctor Blanco, Alfredo Marín:
Upgrading nodes in tree-shaped hub location. Comput. Oper. Res. 102: 75-90 (2019) - Libor Bukata, Premysl Sucha, Zdenek Hanzálek:
Optimizing energy consumption of robotic cells by a Branch & Bound algorithm. Comput. Oper. Res. 102: 52-66 (2019) - Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini:
A branch-and-bound algorithm for the time-Dependent rural postman problem. Comput. Oper. Res. 102: 150-157 (2019) - Roberto Cordone, Pierre Hosteins:
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102: 130-140 (2019) - Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
The planar multifacility collection depots location problem. Comput. Oper. Res. 102: 121-129 (2019) - Luis Gouveia, Markus Leitner, Mario Ruthmair:
Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102: 22-38 (2019) - Zhao-Hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li:
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. Comput. Oper. Res. 102: 39-51 (2019) - Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus:
The p-arborescence star problem: Formulations and exact solution approaches. Comput. Oper. Res. 102: 91-101 (2019) - Daniel Nicola, Rudolf Vetschera, Alina G. Dragomir:
Total distance approximations for routing solutions. Comput. Oper. Res. 102: 67-74 (2019) - Okan Örsan Özener, Ali Ekici, Elvin Çoban:
Improving blood products supply through donation tailoring. Comput. Oper. Res. 102: 10-21 (2019) - Vahid Riahi, M. A. Hakim Newton, Kaile Su, Abdul Sattar:
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling. Comput. Oper. Res. 102: 102-120 (2019) - Zhen Shang, Songzheng Zhao, Jin-Kao Hao, Xue Yang, Fuda Ma:
Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables. Comput. Oper. Res. 102: 141-149 (2019)
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-10-29 15:32 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
