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 27 matches
- 2017
- Mohamed Abouhawwash, Haitham Seada, Kalyanmoy Deb:
Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search. Comput. Oper. Res. 79: 331-346 (2017) - Alessandro Agnetis, Paolo Detti, Patrick Martineau:
Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions. Comput. Oper. Res. 79: 109-118 (2017) - Amir Ahmadi-Javid, Pardis Seyedi, Siddhartha S. Syam:
A survey of healthcare facility location. Comput. Oper. Res. 79: 223-263 (2017) - Marcello Braglia, Davide Castellano, Dongping Song:
Distribution-free approach for stochastic Joint-Replenishment Problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times. Comput. Oper. Res. 79: 161-173 (2017) - Dimo Brockhoff, Joshua D. Knowles, Boris Naujoks, Karthik Sindhya:
Editorial. Comput. Oper. Res. 79: 264-265 (2017) - Xiao-Kun Chang, Ming Dong:
Stochastic programming for qualification management of parallel machines in semiconductor manufacturing. Comput. Oper. Res. 79: 49-59 (2017) - Marek Cornu, Tristan Cazenave, Daniel Vanderpooten:
Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. Comput. Oper. Res. 79: 314-330 (2017) - Fábio Cruz, Anand Subramanian, Bruno Petrato Bruck, Manuel Iori:
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem. Comput. Oper. Res. 79: 19-33 (2017) - Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte:
Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms. Comput. Oper. Res. 79: 140-147 (2017) - Michel Denault, Jean-Guy Simonato:
Dynamic portfolio choices by simulation-and-regression: Revisiting the issue of value function vs portfolio weight recursions. Comput. Oper. Res. 79: 174-189 (2017) - Juan Esteban Diaz, Julia Handl, Dong-Ling Xu:
Evolutionary robust optimization in production planning - interactions between number of objectives, sample size and choice of robustness measure. Comput. Oper. Res. 79: 266-278 (2017) - Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas:
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput. Oper. Res. 79: 12-18 (2017) - Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
A population-based algorithm for solving linear assignment problems with two objectives. Comput. Oper. Res. 79: 291-303 (2017) - Souvik Ghosh, Abhijit Datta Banik:
An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue. Comput. Oper. Res. 79: 1-11 (2017) - Danial Khorasanian, Ghasem Moslehi:
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. Comput. Oper. Res. 79: 94-108 (2017) - Mohammad Khoveyni, Robabeh Eslami, Guoliang Yang:
Negative data in DEA: Recognizing congestion and specifying the least and the most congested decision making units. Comput. Oper. Res. 79: 39-48 (2017) - Murat Köksalan, Diclehan Tezcaner Öztürk:
An evolutionary approach to generalized biobjective traveling salesperson problem. Comput. Oper. Res. 79: 304-313 (2017) - Sergey Kovalev, Xavier Delorme, Alexandre Dolgui, Ammar Oulamara:
Minimizing the number of stations and station activation costs for a production line. Comput. Oper. Res. 79: 131-139 (2017) - Renaud Lacour, Kathrin Klamroth, Carlos M. Fonseca:
A box decomposition algorithm to compute the hypervolume indicator. Comput. Oper. Res. 79: 347-360 (2017) - Zixiang Li, Qiuhua Tang, Liping Zhang:
Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study. Comput. Oper. Res. 79: 78-93 (2017) - Anand Subramanian, Katyanne Farias:
Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. Comput. Oper. Res. 79: 190-206 (2017) - Masoumeh Taslimi, Rajan Batta, Changhyun Kwon:
A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk. Comput. Oper. Res. 79: 119-130 (2017) - Matheus Vanzela, Gislaine Mara Melega, Socorro Rangel, Silvio Alexandre de Araujo:
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production. Comput. Oper. Res. 79: 148-160 (2017) - Dujuan Wang, Feng Liu, Yaochu Jin:
A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling. Comput. Oper. Res. 79: 279-290 (2017) - Xianpeng Wang, Lixin Tang:
A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem. Comput. Oper. Res. 79: 60-77 (2017) - Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo:
A note on a single-machine lot scheduling problem with indivisible orders. Comput. Oper. Res. 79: 34-38 (2017) - Qi Zhang, Arul Sundaramoorthy, Ignacio E. Grossmann, José Mauricio Pinto:
Multiscale production routing in multicommodity supply chains with complex production facilities. Comput. Oper. Res. 79: 207-222 (2017)
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-10 20:48 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