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 50 matches
- 2023
- Eduardo Álvarez-Miranda
, Jordi Pereira, Mariona Vilà:
Analysis of the simple assembly line balancing problem complexity. Comput. Oper. Res. 159: 106323 (2023) - Lavinia Amorosi, Justo Puerto, Carlos Valverde:
A multiple-drone arc routing and mothership coordination problem. Comput. Oper. Res. 159: 106322 (2023) - Mario Benini, Emanuele Blasi, Paolo Detti, Lorenzo Fosci:
Solving crop planning and rotation problems in a sustainable agriculture perspective. Comput. Oper. Res. 159: 106316 (2023) - Bülent Çatay, Ihsan Sadati:
An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping. Comput. Oper. Res. 159: 106310 (2023) - Long Chen, Peng Xu, Reginald R. Souleyrette:
An improved multi-objective framework for the Rich arc routing problem. Comput. Oper. Res. 159: 106345 (2023) - Brenda Cobeña, Ivan Contreras, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía:
The profit-oriented hub line location problem with elastic demand. Comput. Oper. Res. 159: 106335 (2023) - Zongli Dai, Sandun C. Perera, Jian-Jun Wang:
Adopting a hierarchical diagnosis and treatment system to optimize elective surgery scheduling. Comput. Oper. Res. 159: 106342 (2023) - Mohsen Dastpak, Fausto Errico, Ola Jabali:
Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands. Comput. Oper. Res. 159: 106338 (2023) - Ali K. Dogru, Sharif H. Melouk, Ibrahim Çapar, Thomas J. Weida:
Managing interruptions in appointment schedules via patient notification. Comput. Oper. Res. 159: 106352 (2023) - Ngan Ha Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Joint location and cost planning in maximum capture facility location under random utilities. Comput. Oper. Res. 159: 106336 (2023) - Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi, Natalia Jorquera-Bravo:
Robust MILP formulations for the two-stage weighted vertex p-center problem. Comput. Oper. Res. 159: 106334 (2023) - Amro M. El-Adle, Ahmed Ghoniem, Mohamed Haouari:
A variable neighborhood search for parcel delivery by vehicle with drone cycles. Comput. Oper. Res. 159: 106319 (2023) - Inmaculada Espejo, Alfredo Marín:
The p-median problem with upgrading of transportation costs and minimum travel time allocation. Comput. Oper. Res. 159: 106354 (2023) - Inmaculada Espejo, Raúl Páez, Justo Puerto, Antonio M. Rodríguez-Chía:
Facility location problems on graphs with non-convex neighborhoods. Comput. Oper. Res. 159: 106356 (2023) - Sefakor Fianu, Lauren B. Davis:
Heuristic algorithm for nested Markov decision process: Solution quality and computational complexity. Comput. Oper. Res. 159: 106297 (2023) - Nayane Carvalho Freitas, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale. Comput. Oper. Res. 159: 106350 (2023) - Serena Fugaro, Antonino Sgalambro:
Advanced network connectivity features and zonal requirements in Covering Location problems. Comput. Oper. Res. 159: 106307 (2023) - Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford:
On some lower bounds for the permutation flowshop problem. Comput. Oper. Res. 159: 106320 (2023) - Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton:
Solution techniques for Bi-level Knapsack Problems. Comput. Oper. Res. 159: 106343 (2023) - Mayukh Ghosh, Alex Kuiper, Roshan Mahes, Donato Maragno:
Learn global and optimize local: A data-driven methodology for last-mile routing. Comput. Oper. Res. 159: 106312 (2023) - Rosemarie Santa González, Marilène Cherkesly, Teodor Gabriel Crainic, Marie-Ève Rancourt:
Multi-period location routing: An application to the planning of mobile clinic operations in Iraq. Comput. Oper. Res. 159: 106288 (2023) - Ilyas Himmich, El Mehdi Er Raqabi, Nizar El Hachemi, Issmail El Hallaoui, Abdelmoutalib Metrane, François Soumis:
MPILS: An Automatic Tuner for MILP Solvers. Comput. Oper. Res. 159: 106344 (2023) - Yuzhen Hu, Pu Zhang, Kang Zhao, Song Zhang, Bo Fan:
Disruption recovery for the pickup and delivery problem with time windows - A scenario-based approach for online food delivery. Comput. Oper. Res. 159: 106337 (2023) - Ming Huang, Baigang Du, Jun Guo:
A hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windows. Comput. Oper. Res. 159: 106346 (2023) - Xianzhen Jiang, Xiaomin Ye, Zefeng Huang, Meixing Liu:
A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations. Comput. Oper. Res. 159: 106341 (2023) - Amir Khaleghi, Alireza Eydi:
Multi-period hub location problem considering polynomial time-dependent demand. Comput. Oper. Res. 159: 106357 (2023) - Mercedes Landete, Isaac Plana, José Luis Sainz-Pardo, José María Sanchis:
Upgrading edges in the Graphical TSP. Comput. Oper. Res. 159: 106321 (2023) - Florin Leutwiler, Francesco Corman:
Set covering heuristics in a Benders decomposition for railway timetabling. Comput. Oper. Res. 159: 106339 (2023) - Peize Li, Qiang Xue, Ziteng Zhang, Jian Chen, Dequn Zhou:
Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II. Comput. Oper. Res. 159: 106360 (2023) - Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses:
Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation. Comput. Oper. Res. 159: 106324 (2023)
skipping 20 more matches
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-11-14 06:00 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:
