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 20 matches
- 2020
- Levi Ribeiro de Abreu, Jesus O. Cunha, Bruno A. Prata, Jose M. Framiñan:
A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput. Oper. Res. 113 (2020) - Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero:
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem. Comput. Oper. Res. 113 (2020) - Faisal Alkaabneh, Ali Diabat, Huaizhu Oliver Gao:
Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs. Comput. Oper. Res. 113 (2020) - Eduardo A. J. Anacleto, Cláudio N. Meneses, Santiago Valdés Ravelo:
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. Comput. Oper. Res. 113 (2020) - Janniele A. S. Araujo, Haroldo G. Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza:
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Comput. Oper. Res. 113 (2020) - Rui Chen, Xinwu Qian, Lixin Miao, Satish V. Ukkusuri:
Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium. Comput. Oper. Res. 113 (2020) - Alina G. Dragomir, Karl F. Doerner:
Solution techniques for the inter-modal pickup and delivery problem in two regions. Comput. Oper. Res. 113 (2020) - Simon Emde, Lukas Polten, Michel Gendreau:
Logic-based benders decomposition for scheduling a batching machine. Comput. Oper. Res. 113 (2020) - Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala:
Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113 (2020) - Carl Axel Folkestad, Nora Hansen, Kjetil Fagerholt, Henrik Andersson, Giovanni Pantuso:
Optimal charging and repositioning of electric vehicles in a free-floating carsharing system. Comput. Oper. Res. 113 (2020) - André Hottung, Shunji Tanaka, Kevin Tierney:
Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput. Oper. Res. 113 (2020) - Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural:
Multi-facility green Weber problem. Comput. Oper. Res. 113 (2020) - Lucas Kletzander, Nysret Musliu:
Solving the general employee scheduling problem. Comput. Oper. Res. 113 (2020) - Zhaohui Liu, Jiyuan Zhan:
Online fractional hierarchical scheduling on uniformly related machines. Comput. Oper. Res. 113 (2020) - Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte:
Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113 (2020) - Iliya Markov, Michel Bierlaire, Jean-François Cordeau, Yousef Maknoon, Sacha Varone:
Waste collection inventory routing with non-stationary stochastic demands. Comput. Oper. Res. 113 (2020) - John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat:
Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. 113 (2020) - Stefan Poikonen, Bruce L. Golden:
Multi-visit drone routing problem. Comput. Oper. Res. 113 (2020) - Rico Walter:
A note on "Workload smoothing in simple assembly line balancing". Comput. Oper. Res. 113 (2020) - Cheng-Hung Wu, Yi-Chun Yao, Stéphane Dauzère-Pérès, Cheng-Juei Yu:
Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration. Comput. Oper. Res. 113 (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 2025-01-11 11:17 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