Testing heuristics: We have it all wrong
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- Branch-and-cut solution of inference problems in propositional logic
- Branching rules for satisfiability
- Detecting embedded Horn structure in propositional logic
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Needed: An Empirical Science of Algorithms
- On renamable Horn and generalized Horn functions
- Recognizing disguised NR(1) instances of the satisfiability problem
Cited in
(63)- Designing data warehouses for equipment management system with genetic algorithms
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Testing cut generators for mixed-integer linear programming
- Instance space analysis for 2D bin packing mathematical models
- Difficulties in the evaluation of solving algorithms
- Towards a practical engineering tool for rostering
- Evolving test instances of the Hamiltonian completion problem
- Towards an efficient library for SAT: A manifesto
- A causal framework for stochastic local search optimization algorithms
- Static stability versus packing efficiency in online three-dimensional packing problems: a new approach and a computational study
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- Experimental design heuristics for scientific discovery: the use of “baseline” and “known standard” controls
- Solving a multi-resolution model of the train platforming problem using Lagrangian relaxation with dynamic multiplier aggregation
- A hybrid method for multidimensional scaling using city-block distances
- A neighborhood for complex job shop scheduling problems with regular objectives
- Towards objective measures of algorithm performance across instance space
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Algorithms and experiments: The new (and old) methodology
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Optimal product design using a colony of virtual ants
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms
- No more ``Partial and ``Full Looking Ahead
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- Machine scheduling performance with maintenance and failure
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Metaheuristics ``In the large
- Machine scheduling instance generation by reverse engineering from instance space analysis
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Core instances for testing: a case study
- Evaluating general purpose automated theorem proving systems
- P-algorithm based on a simplicial statistical model of multimodal functions
- NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM
- How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs?
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Mixed logical-linear programming
- Measuring instance difficulty for combinatorial optimization problems
- Generating new test instances by evolving in instance space
- A multilevel evaluation method for heuristics with an application to the VRPTW
- Enhanced instance space analysis for the maximum flow problem
- Generation techniques for linear programming instances with controllable properties
- COCO: a platform for comparing continuous optimizers in a black-box setting
- Research trends in combinatorial optimization
- Towards a theory of practice in metaheuristics design: A machine learning perspective
- On convergence rate of a rectangular partition based global optimization algorithm
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Metaheuristics -- the metaphor exposed
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Metaheuristics: A bibliography
- Solving zero-one mixed integer programming problems using tabu search
- Designing and reporting on computational experiments with heuristic methods
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim
- A critical analysis of the “improved Clarke and Wright savings algorithm”
- An analysis of budgeted parallel search on conditional Galton-Watson trees
- Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
- Review on nature-inspired algorithms
- On the impact of initialisation strategies on maximum flow algorithm performance
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
This page was built for publication: Testing heuristics: We have it all wrong
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922626)
