Testing heuristics: We have it all wrong
From MaRDI portal
Publication:1922626
DOI10.1007/BF02430364zbMath0853.68155OpenAlexW2092993939MaRDI QIDQ1922626
Publication date: 1 September 1996
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02430364
Related Items
NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Machine scheduling performance with maintenance and failure, Towards objective measures of algorithm performance across instance space, Generating new test instances by evolving in instance space, A neighborhood for complex job shop scheduling problems with regular objectives, Unnamed Item, Enhanced instance space analysis for the maximum flow problem, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, No more ``Partial and ``Full Looking Ahead, A critical analysis of the “improved Clarke and Wright savings algorithm”, P-algorithm based on a simplicial statistical model of multimodal functions, A multilevel evaluation method for heuristics with an application to the VRPTW, Research trends in combinatorial optimization, New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Optimal product design using a colony of virtual ants, Solving the continuous flow-shop scheduling problem by metaheuristics., Mixed logical-linear programming, Generation techniques for linear programming instances with controllable properties, What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, A one-step worst-case optimal algorithm for bi-objective univariate optimization, 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?, Review on nature-inspired algorithms, Towards a practical engineering tool for rostering, Metaheuristics ``In the large, On convergence rate of a rectangular partition based global optimization algorithm, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, Measuring instance difficulty for combinatorial optimization problems, A statistical model-based algorithm for ‘black-box’ multi-objective optimisation, 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, Designing data warehouses for equipment management system with genetic algorithms, A hybrid method for multidimensional scaling using city-block distances, Testing cut generators for mixed-integer linear programming, An analysis of budgeted parallel search on conditional Galton-Watson trees, 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, Metaheuristics—the metaphor exposed, Towards a theory of practice in metaheuristics design: A machine learning perspective, COCO: a platform for comparing continuous optimizers in a black-box setting, Evolving test instances of the Hamiltonian completion problem, Evaluating general purpose automated theorem proving systems, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing, Solving zero-one mixed integer programming problems using tabu search
Cites Work
- Unnamed Item
- Detecting embedded Horn structure in propositional logic
- On renamable Horn and generalized Horn functions
- Branch-and-cut solution of inference problems in propositional logic
- Branching rules for satisfiability
- Recognizing disguised NR(1) instances of the satisfiability problem
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Needed: An Empirical Science of Algorithms
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- Feature Article—Toward an Experimental Method for Algorithm Simulation
