Needed: An Empirical Science of Algorithms
From MaRDI portal
Publication:4301284
DOI10.1287/opre.42.2.201zbMath0805.90119OpenAlexW2103824021MaRDI QIDQ4301284
Publication date: 20 September 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.2.201
Abstract computational complexity for mathematical programming problems (90C60) Mathematical programming (90C99)
Related Items
Optimal experimental design for combinatorial problems, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, On bicriterion minimal spanning trees: An approximation, Machine scheduling performance with maintenance and failure, Branching rules for satisfiability, Towards objective measures of algorithm performance across instance space, Modelling and solving temporal reasoning as propositional satisfiability, An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes, Generating new test instances by evolving in instance space, Unnamed Item, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Testing heuristics: We have it all wrong, An empirical study of phase transitions in binary constraint satisfaction problems, Exploring the role of graph spectra in graph coloring algorithm performance, Solving the continuous flow-shop scheduling problem by metaheuristics., Generation techniques for linear programming instances with controllable properties, Measuring the impact of primal heuristics, A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem, Group-scheduling problems in electronics manufacturing, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, Exploring the performance of spatial stochastic simulation algorithms, On SAT instance classes and a method for reliable performance experiments with SAT solvers, Core instances for testing: a case study, Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis, 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, AEGIS---attribute experimentation guiding improvement searches, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, Decomposition methods for large job shops
