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 22 matches
- 2024
- Faisal Alkaabneh:
Matheuristic for synchronized vehicle routing problem with multiple constraints and variable service time: Managing a fleet of sprayers and a tender tanker. Comput. Oper. Res. 162: 106454 (2024) - Víctor Blanco, Alfredo Marín, Justo Puerto:
Intra-facility equity in discrete and continuous p-facility location problems. Comput. Oper. Res. 162: 106487 (2024) - Danny Blom, Christopher Hojny, Bart Smeulders:
Cutting Plane Approaches for the Robust Kidney Exchange Problem. Comput. Oper. Res. 162: 106470 (2024) - William N. Caballero, José Manuel Camacho, Tahir Ekin, Roi Naveiro:
Manipulating hidden-Markov-model inferences by corrupting batch data. Comput. Oper. Res. 162: 106478 (2024) - Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. Comput. Oper. Res. 162: 106482 (2024) - Juan Francisco Correcher, Federico Perea, Ramón Alvarez-Valdés:
The berth allocation and quay crane assignment problem with crane travel and setup times. Comput. Oper. Res. 162: 106468 (2024) - Xudong Diao, Meng Qiu, Gangyan Xu:
Electric vehicle-based express service network design with recharging management: A branch-and-price approach. Comput. Oper. Res. 162: 106469 (2024) - Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, Hamid R. Tizhoosh:
Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images. Comput. Oper. Res. 162: 106483 (2024) - Kanxin Hu, Yuxin Che, Tsan Sheng Ng, Jie Deng:
Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints. Comput. Oper. Res. 162: 106474 (2024) - Moacyr Carlos Possan Junior, Adalberto Sato Michels, Leandro Magatão:
An exact constraint programming based procedure for the multi-manned assembly line balancing problem. Comput. Oper. Res. 162: 106451 (2024) - Anqi Li, Congying Han, Tiande Guo, Bonan Li:
Generating linear programming instances with controllable rank and condition number. Comput. Oper. Res. 162: 106471 (2024) - Sasan Mahmoudinazlou, Changhyun Kwon:
A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem. Comput. Oper. Res. 162: 106455 (2024) - Ramón Piedra-de-la-Cuadra, Francisco A. Ortega:
Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks. Comput. Oper. Res. 162: 106460 (2024) - Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa:
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. Comput. Oper. Res. 162: 106467 (2024) - Radoslaw Puka, Iwona Skalna, Jerzy Duda, Adam Stawowy:
Deterministic constructive vN-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion. Comput. Oper. Res. 162: 106473 (2024) - Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei:
An asynchronous parallel benders decomposition method for stochastic network design problems. Comput. Oper. Res. 162: 106459 (2024) - Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White:
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis. Comput. Oper. Res. 162: 106477 (2024) - Shaban Usman, Cong Lu:
Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm. Comput. Oper. Res. 162: 106456 (2024) - Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie:
Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers. Comput. Oper. Res. 162: 106475 (2024) - Guo Xinghai, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu:
Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control. Comput. Oper. Res. 162: 106472 (2024) - Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu:
An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry. Comput. Oper. Res. 162: 106476 (2024) - Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao:
Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method. Comput. Oper. Res. 162: 106479 (2024)
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-03 07:05 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