Feature Article—Toward an Experimental Method for Algorithm Simulation

DOI10.1287/ijoc.8.1.1zbMath0854.68038OpenAlexW1981832641MaRDI QIDQ4888173

C. C. McGeoch

Publication date: 24 July 1996

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.8.1.1

zbMATH Keywords

algorithmic problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items

Best practices for comparing optimization algorithms, Generating new test instances by evolving in instance space, Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system, Designing and reporting on computational experiments with heuristic methods, Testing heuristics: We have it all wrong, A multilevel evaluation method for heuristics with an application to the VRPTW, Generation techniques for linear programming instances with controllable properties, Measuring the impact of primal heuristics, Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives, Core instances for testing: a case study, Testing cut generators for mixed-integer linear programming, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Towards a theory of practice in metaheuristics design: A machine learning perspective, Decomposition methods for large job shops