Needed: An Empirical Science of Algorithms
From MaRDI portal
Recommendations
Cited in
(46)- AEGIS---attribute experimentation guiding improvement searches
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Complexity, algorithms, programs, systems: The shifting focus
- On bicriterion minimal spanning trees: An approximation
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Decomposition methods for large job shops
- 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
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Core instances for testing: a case study
- Branching rules for satisfiability
- Metaheuristics: A bibliography
- Designing and reporting on computational experiments with heuristic methods
- Testing heuristics: We have it all wrong
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- 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
- Generation techniques for linear programming instances with controllable properties
- Optimal experimental design for combinatorial problems
- Modelling and solving temporal reasoning as propositional satisfiability
- 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
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- Machine scheduling performance with maintenance and failure
- An empirical study of phase transitions in binary constraint satisfaction problems
- Algorithms and experiments: The new (and old) methodology
- SatEx: A web-based framework for SAT experimentation
- Among several successful algorithms, simpler ones usually work better: a possible explanation of an empirical observation
- Towards objective measures of algorithm performance across instance space
- Generating new test instances by evolving in instance space
- Algorithmics -- is there hope for a unified theory? (Invited talk)
- Exploring the role of graph spectra in graph coloring algorithm performance
- scientific article; zbMATH DE number 1956212 (Why is no real title available?)
- Algorithmic data science (invited talk)
- Exploring the performance of spatial stochastic simulation algorithms
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Instance space analysis for 2D bin packing mathematical models
- General VNS for asymmetric vehicle routing problem with time and capacity constraints
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim
- A causal framework for stochastic local search optimization algorithms
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Machine scheduling instance generation by reverse engineering from instance space analysis
- Testing cut generators for mixed-integer linear programming
- Group-scheduling problems in electronics manufacturing
This page was built for publication: Needed: An Empirical Science of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4301284)
