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 19 matches
- 2022
- Gözde Alp, Ali Fuat Alkaya:
An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment. Comput. Oper. Res. 141: 105685 (2022) - Nicolas Cheimanoff, Frédéric Fontane, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems. Comput. Oper. Res. 141: 105695 (2022) - Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble:
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - Zehranaz Dönmez, Serkan Turhan, Özlem Karsu, Bahar Yetis Kara, Oya Ekin Karasan:
Fair allocation of personal protective equipment to health centers during early phases of a pandemic. Comput. Oper. Res. 141: 105690 (2022) - Diana L. Huerta-Muñoz, Claudia Archetti, Elena Fernández, Federico Perea:
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. Comput. Oper. Res. 141: 105662 (2022) - Ilker Küçükoglu:
The traveling purchaser problem with fast service option. Comput. Oper. Res. 141: 105700 (2022) - Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh:
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. Comput. Oper. Res. 141: 105686 (2022) - Rong-juan Luo, Shoufeng Ji, Yuanyuan Ji:
An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers. Comput. Oper. Res. 141: 105677 (2022) - Joshua T. Margolis, Yongjia Song, Scott J. Mason:
A Markov decision process model on dynamic routing for target surveillance. Comput. Oper. Res. 141: 105699 (2022) - Pierre-Antoine Morin, Christian Artigues, Alain Haït, Tamás Kis, Frits C. R. Spieksma:
A project scheduling problem with periodically aggregated resource-constraints. Comput. Oper. Res. 141: 105688 (2022) - Malena Reiners, Kathrin Klamroth, Fabian Heldmann, Michael Stiglmayr:
Efficient and sparse neural networks by pruning weights in a multiobjective learning approach. Comput. Oper. Res. 141: 105676 (2022) - M. Salehi Sarbijan, Javad Behnamian:
Multi-fleet feeder vehicle routing problem using hybrid metaheuristic. Comput. Oper. Res. 141: 105696 (2022) - Simon Strassl, Nysret Musliu:
Instance space analysis and algorithm selection for the job shop scheduling problem. Comput. Oper. Res. 141: 105661 (2022) - Heqing Tan, Muqing Du, Anthony Chen:
Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size. Comput. Oper. Res. 141: 105723 (2022) - Alper Türkyilmaz, Özlem Senvar, Irem Ünal, Serol Bulkan:
A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem. Comput. Oper. Res. 141: 105694 (2022) - Tim van der Weide, Qichen Deng, Bruno Filipe Santos:
Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty. Comput. Oper. Res. 141: 105667 (2022) - Daniel Yamín, Andrés L. Medaglia, A. Arun Prakash:
Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks. Comput. Oper. Res. 141: 105671 (2022) - Yaser Zarouk, Iraj Mahdavi, Javad Rezaeian, Francisco J. Santos-Arteaga:
A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times. Comput. Oper. Res. 141: 105698 (2022) - Chuang Zhang, Yantong Li, Junhai Cao, Xin Wen:
On the mass COVID-19 vaccination scheduling problem. Comput. Oper. Res. 141: 105704 (2022)
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-05 01:06 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