Augmented intuition: a bridge between theory and practice
Author
Abstract
Suggested Citation
DOI: 10.1007/s10732-020-09465-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- J. N. Hooker, 1994. "Needed: An Empirical Science of Algorithms," Operations Research, INFORMS, vol. 42(2), pages 201-212, April.
- Pablo Moscato & Michael G. Norman, 1998. "On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 121-132, May.
- Gexiang Zhang & Linqiang Pan & Ferrante Neri & Maoguo Gong & Alberto Leporati, 2017. "Metaheuristic Optimization: Algorithmic Design and Applications," Journal of Optimization, Hindawi, vol. 2017, pages 1-2, September.
- Yongfei Zhang & Jun Wu & Liming Zhang & Peng Zhao & Junping Zhou & Minghao Yin, 2018. "An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-10, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Mastrolilli, Monaldo & Bianchi, Leonora, 2005. "Core instances for testing: A case study," European Journal of Operational Research, Elsevier, vol. 166(1), pages 51-62, October.
- Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "An effective two phase heuristic for synchronized seru production scheduling and 3PL transportation problems," International Journal of Production Economics, Elsevier, vol. 268(C).
- Felipe Campelo & Elizabeth F. Wanner, 2020. "Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances," Journal of Heuristics, Springer, vol. 26(6), pages 851-883, December.
- Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
- Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
- Liu, Chang & Smith-Miles, Kate & Wauters, Tony & Costa, Alysson M., 2024. "Instance space analysis for 2D bin packing mathematical models," European Journal of Operational Research, Elsevier, vol. 315(2), pages 484-498.
- Reilly, Charles H. & Sapkota, Nabin, 2015. "A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances," European Journal of Operational Research, Elsevier, vol. 241(3), pages 642-652.
- Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
- John Nartey Kanamitie & John Nketsiah & Kennedy Asenso, 2023. "English Language Proficiency: A Predictor of Academic Performance in Biology," International Journal of Research and Innovation in Social Science, International Journal of Research and Innovation in Social Science (IJRISS), vol. 7(3), pages 358-367, March.
- Petar Jevtić & J. Michael Steele, 2015. "Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 992-1004, October.
- Pablo Moscato & Michael G. Norman, 1998. "On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 121-132, May.
- Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
- Fink, Andreas & Vo[ss], Stefan, 2003. "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, Elsevier, vol. 151(2), pages 400-414, December.
- Haipeng Guo & William Hsu, 2007. "A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem," Annals of Operations Research, Springer, vol. 156(1), pages 61-82, December.
More about this item
Keywords
Vertex cover; Augmented intelligence; Human–computer data-driven discovery; Heuristics; Algorithms; Kernelization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:27:y:2021:i:4:d:10.1007_s10732-020-09465-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.