A decision-theoretic framework for comparing heuristics

DOI10.1016/0377-2217(84)90182-6zbMATH Open0546.90069OpenAlexW2086561283MaRDI QIDQ798566FDOQ798566

Authors: Bruce Golden, Arjang A. Assad 

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90182-6

Recommendations

• Multiheuristic approach to discrete optimization problems
• An overview of heuristic solution methods
• scientific article; zbMATH DE number 4189487
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Probabilistic approach to assessment of heuristics in 0?1 linear programming

zbMATH Keywords

combinatorial optimizationaccuracycomparison of heuristics

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Heuristics and their design: A survey

Cited In (11)

• A Sensitive Metaheuristic for Solving a Large Optimization Problem
• Experimentation in optimization
• Heuristic methods and applications: A categorized survey
• A framework for explaining decision-theoretic advice
• Choosing a good toolkit. II: Bayes-rule based heuristics
• Quantifying heuristics in the ordinal optimization framework
• The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
• Computational Science and Its Applications – ICCSA 2004
• HyFlex: a benchmark framework for cross-domain heuristic search
• Comparison of the performances of decision aimed algorithms with Bayesian and beliefs basis
• Average and worst-case analysis of heuristics for the maximum tardiness problem

This page was built for publication: A decision-theoretic framework for comparing heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798566)