default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSigurdur Ólafsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i1]AGaurav Arwade, Sigurdur Olafsson:
Sub-Setting Algorithm for Training Data Selection in Pattern Recognition. CoRR abs/2110.06527 (2021)- 2020
- [j24]Hieu Pham
, Sigurður Olafsson:
On Cesáro Averages for Weighted Trees in the Random Forest. J. Classif. 37(1): 223-236 (2020) - [j23]Jing Li, John Reisner, Hieu Pham, Sigurdur Ólafsson, Stephen B. Vardeman:
Biclustering with missing data. Inf. Sci. 510: 304-316 (2020)
2010 – 2019
- 2019
- [j22]Hieu Pham, Sigurdur Ólafsson:
Bagged ensembles with tunable parameters. Comput. Intell. 35(1): 184-203 (2019) - [j21]Samira Karimzadeh, Sigurdur Ólafsson:
Data clustering using proximity matrices with missing values. Expert Syst. Appl. 126: 265-276 (2019) - [j20]John Reisner, Hieu Pham, Sigurdur Olafsson, Stephen B. Vardeman, Jing Li:
biclustermd: An R Package for Biclustering with Missing Values. R J. 11(2): 69 (2019) - 2013
- [j19]Jong-Seok Lee, Sigurdur Ólafsson:
A meta-learning approach for determining the number of clusters with consideration of nearest neighbors. Inf. Sci. 232: 208-224 (2013) - 2011
- [j18]Alireza Kabirian, Sigurdur Ólafsson:
Continuous optimization via simulation using Golden Region search. Eur. J. Oper. Res. 208(1): 19-27 (2011) - [j17]Rui Yang, Sigurdur Ólafsson:
Classification for predicting offender affiliation with murder victims. Expert Syst. Appl. 38(11): 13518-13526 (2011) - [j16]Jong-Seok Lee, Sigurdur Ólafsson:
Data clustering by minimizing disconnectivity. Inf. Sci. 181(4): 732-746 (2011) - [j15]John Jackman, Z. Guerra de Castillo, Sigurdur Ólafsson:
Stochastic flow shop scheduling model for the Panama Canal. J. Oper. Res. Soc. 62(1): 69-80 (2011) - 2010
- [j14]Sameh Al-Shihabi, Sigurdur Ólafsson:
A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem. Comput. Oper. Res. 37(2): 247-255 (2010)
2000 – 2009
- 2009
- [j13]Jong-Seok Lee, Sigurdur Ólafsson:
Two-way cooperative prediction for collaborative filtering recommendations. Expert Syst. Appl. 36(3): 5353-5361 (2009) - [j12]J. Yang, Sigurdur Ólafsson:
Near-optimal feature selection for large databases. J. Oper. Res. Soc. 60(8): 1045-1055 (2009) - [j11]J. Kim, J. Yang, Sigurdur Ólafsson:
An optimization approach to partitional data clustering. J. Oper. Res. Soc. 60(8): 1069-1084 (2009) - [c11]Alireza Kabirian, Sigurdur Ólafsson:
Simulation Optimization with Hybrid Golden Region Search. WSC 2009: 551-562 - [c10]Alireza Kabirian, Sigurdur Ólafsson:
Selection of the Best with Stochastic Constraints. WSC 2009: 574-583 - [r1]Leyuan Shi, Sigurdur Ólafsson:
Nested Partitions Optimization. Encyclopedia of Optimization 2009: 2533-2539 - 2008
- [j10]Sigurdur Ólafsson, Xiaonan Li, Shuning Wu:
Operations research and data mining. Eur. J. Oper. Res. 187(3): 1429-1448 (2008) - 2007
- [c9]Alireza Kabirian, Sigurdur Ólafsson:
Allocation of simulation runs for simulation optimization. WSC 2007: 363-371 - 2006
- [j9]Sigurdur Ólafsson:
Introduction to operations research and data mining. Comput. Oper. Res. 33(11): 3067-3069 (2006) - [j8]Jaekyung Yang, Sigurdur Ólafsson:
Optimization-based feature selection with adaptive instance sampling. Comput. Oper. Res. 33(11): 3088-3106 (2006) - [p1]Sigurdur Ólafsson:
Chapter 21 Metaheuristics. Simulation 2006: 633-654 - 2005
- [j7]Sigurdur Ólafsson, Jaekyung Yang:
Intelligent Partitioning for Feature Selection. INFORMS J. Comput. 17(3): 339-355 (2005) - [j6]Xiaonan Li, Sigurdur Ólafsson:
Discovering Dispatching Rules Using Data Mining. J. Sched. 8(6): 515-527 (2005) - 2003
- [j5]Sigurdur Ólafsson:
Focused issue on operations research and data mining. Comput. Oper. Res. 30(13): 2079-2080 (2003) - 2002
- [j4]Sigurdur Ólafsson, Leyuan Shi:
Ordinal Comparison via the Nested Partitions Method. Discret. Event Dyn. Syst. 12(2): 211-239 (2002) - [c8]Sigurdur Ólafsson, Jumi Kim:
Simulation optimization: simulation optimization. WSC 2002: 79-84 - [c7]Jumi Kim, Sigurdur Ólafsson:
Optimization via simulation: two-stage NP method with inheritance. WSC 2002: 279-284 - 2001
- [j3]Leyuan Shi, Sigurdur Ólafsson, Qun Chen:
An Optimization Framework for Product Design. Manag. Sci. 47(12): 1681-1692 (2001) - [c6]Sigurdur Ólafsson, Jumi Kim:
Simulation optimization: towards a framework for black-box simulation optimization. WSC 2001: 300-306 - 2000
- [j2]Leyuan Shi, Sigurdur Ólafsson:
Nested Partitions Method for Global Optimization. Oper. Res. 48(3): 390-407 (2000) - [c5]Sigurdur Ólafsson, Nithin Gopinath:
Optimal selection probability in the two-stage nested partitions method for simulation-based optimization. WSC 2000: 736-742
1990 – 1999
- 1999
- [j1]Leyuan Shi, Sigurdur Ólafsson, Ning Sun:
New parallel randomized algorithms for the traveling salesman problem. Comput. Oper. Res. 26(4): 371-394 (1999) - [c4]Sigurdur Ólafsson:
Iterative ranking-and-selection for large-scale optimization. WSC 1999: 479-485 - [c3]Sigurdur Ólafsson, Leyuan Shi:
Optimization via adaptive sampling and regenerative simulation. WSC 1999: 666-672 - 1998
- [c2]Sigurdur Ólafsson, Leyuan Shi:
Stopping Criterion for a Simulation-Based Optimization Method. WSC 1998: 743-750 - 1997
- [c1]Leyuan Shi, Sigurdur Ólafsson:
An Integrated Framework for Deterministic and Stochastic Optimization. WSC 1997: 358-365
Coauthor Index
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.
last updated on 2024-04-25 05:45 CEST 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:
