@article{smith-miles14objective,
  title = {Towards Objective Measures of Algorithm Performance across Instance Space},
  author = {{Smith-Miles}, Kate and Baatar, Davaatseren and Wreford, Brendan and Lewis, Rhyd},
  year = {2014},
  month = may,
  journal = {Computers \& Operations Research},
  volume = {45},
  pages = {12--24},
  issn = {0305-0548},
  doi = {10.1016/j.cor.2013.11.015},
  abstract = {This paper tackles the difficult but important task of objective algorithm performance assessment for optimization. Rather than reporting average performance of algorithms across a set of chosen instances, which may bias conclusions, we propose a methodology to enable the strengths and weaknesses of different optimization algorithms to be compared across a broader instance space. The results reported in a recent Computers and Operations Research paper comparing the performance of graph coloring heuristics are revisited with this new methodology to demonstrate (i) how pockets of the instance space can be found where algorithm performance varies significantly from the average performance of an algorithm; (ii) how the properties of the instances can be used to predict algorithm performance on previously unseen instances with high accuracy; and (iii) how the relative strengths and weaknesses of each algorithm can be visualized and measured objectively.},
  langid = {english},
  file = {/Users/acosta/Zotero/storage/8MPM53YH/Smith-Miles et al. - 2014 - Towards objective measures of algorithm performanc.pdf;/Users/acosta/Zotero/storage/8UNTXFS2/S0305054813003389.html}
}

{"_id":{"_str":"537c54bdb3aa042605005e37"},"__v":0,"authorIDs":[],"author_short":["Smith-Miles, K.","Baatar, D.","Wreford, B.","Lewis, R."],"bibbaseid":"smithmiles-baatar-wreford-lewis-towardsobjectivemeasuresofalgorithmperformanceacrossinstancespace-2014","bibdata":{"bibtype":"article","type":"article","title":"Towards Objective Measures of Algorithm Performance across Instance Space","author":[{"propositions":[],"lastnames":["Smith-Miles"],"firstnames":["Kate"],"suffixes":[]},{"propositions":[],"lastnames":["Baatar"],"firstnames":["Davaatseren"],"suffixes":[]},{"propositions":[],"lastnames":["Wreford"],"firstnames":["Brendan"],"suffixes":[]},{"propositions":[],"lastnames":["Lewis"],"firstnames":["Rhyd"],"suffixes":[]}],"year":"2014","month":"May","journal":"Computers & Operations Research","volume":"45","pages":"12–24","issn":"0305-0548","doi":"10.1016/j.cor.2013.11.015","abstract":"This paper tackles the difficult but important task of objective algorithm performance assessment for optimization. Rather than reporting average performance of algorithms across a set of chosen instances, which may bias conclusions, we propose a methodology to enable the strengths and weaknesses of different optimization algorithms to be compared across a broader instance space. The results reported in a recent Computers and Operations Research paper comparing the performance of graph coloring heuristics are revisited with this new methodology to demonstrate (i) how pockets of the instance space can be found where algorithm performance varies significantly from the average performance of an algorithm; (ii) how the properties of the instances can be used to predict algorithm performance on previously unseen instances with high accuracy; and (iii) how the relative strengths and weaknesses of each algorithm can be visualized and measured objectively.","langid":"english","file":"/Users/acosta/Zotero/storage/8MPM53YH/Smith-Miles et al. - 2014 - Towards objective measures of algorithm performanc.pdf;/Users/acosta/Zotero/storage/8UNTXFS2/S0305054813003389.html","bibtex":"@article{smith-miles14objective,\n title = {Towards Objective Measures of Algorithm Performance across Instance Space},\n author = {{Smith-Miles}, Kate and Baatar, Davaatseren and Wreford, Brendan and Lewis, Rhyd},\n year = {2014},\n month = may,\n journal = {Computers \\& Operations Research},\n volume = {45},\n pages = {12--24},\n issn = {0305-0548},\n doi = {10.1016/j.cor.2013.11.015},\n abstract = {This paper tackles the difficult but important task of objective algorithm performance assessment for optimization. Rather than reporting average performance of algorithms across a set of chosen instances, which may bias conclusions, we propose a methodology to enable the strengths and weaknesses of different optimization algorithms to be compared across a broader instance space. The results reported in a recent Computers and Operations Research paper comparing the performance of graph coloring heuristics are revisited with this new methodology to demonstrate (i) how pockets of the instance space can be found where algorithm performance varies significantly from the average performance of an algorithm; (ii) how the properties of the instances can be used to predict algorithm performance on previously unseen instances with high accuracy; and (iii) how the relative strengths and weaknesses of each algorithm can be visualized and measured objectively.},\n langid = {english},\n file = {/Users/acosta/Zotero/storage/8MPM53YH/Smith-Miles et al. - 2014 - Towards objective measures of algorithm performanc.pdf;/Users/acosta/Zotero/storage/8UNTXFS2/S0305054813003389.html}\n}\n\n","author_short":["Smith-Miles, K.","Baatar, D.","Wreford, B.","Lewis, R."],"key":"smith-miles14objective","id":"smith-miles14objective","bibbaseid":"smithmiles-baatar-wreford-lewis-towardsobjectivemeasuresofalgorithmperformanceacrossinstancespace-2014","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://www.dropbox.com/s/6qxz2tlaz2bi6av/costaam.bib?dl=1","downloads":0,"keywords":[],"search_terms":["towards","objective","measures","algorithm","performance","instance","space","smith-miles","baatar","wreford","lewis"],"title":"Towards Objective Measures of Algorithm Performance across Instance Space","year":2014,"dataSources":["DvJyE8CDhC2bX8rnN","C8ZTSgdcqKrDKQsFr"]}