Statistical Analysis of Computational Tests of Algorithms and Heuristics

DOI10.1287/IJOC.12.1.24.11899MaRDI QIDQ4427318zbMATH OpenOpenAlexFDO

Authors Marie Coffin, Matthew J. Saltzman

Publication date 6 November 2003

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ef87199c014a18b8b58e05822c5c05ae743447f4

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Design and Analysis of Optimization Algorithms Using Computational Statistics
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Experimental analysis of algorithms
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• scientific article; zbMATH DE number 1857683

Cited in

(26)

• Finding non-dominated solutions in bi-objective integer network flow problems
• 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
• A statistical analysis of an algorithm's complexity
• 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
• On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
• A mixed evolutionary-statistical analysis of an algorithm's complexity
• Designing and reporting on computational experiments with heuristic methods
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization
• New -constraint methods for multi-objective integer linear programming: a Pareto front representation approach
• A simple empirical formula for categorizing computing operations
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• Poisoning finite-horizon Markov decision processes at design time
• In-depth analysis of granular local search for capacitated vehicle routing
• Hybridizations of GRASP with path relinking for the far from most string problem
• Algorithm 970
• Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization
• scientific article; zbMATH DE number 4100590 (Why is no real title available?)
• scientific article; zbMATH DE number 1293578 (Why is no real title available?)
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Log transformations: What not to expect when you’re expecting
• Use of Representative Operation Counts in Computational Testing of Algorithms
• Manipulating hidden-Markov-model inferences by corrupting batch data
• Local search heuristics for the probabilistic dial-a-ride problem
• Rule-based design of a granular tabu search for the multi-depot vehicle routing problem
• Regulating the rebound effect in the traveling purchaser problem
• Group-scheduling problems in electronics manufacturing

This page was built for publication: Statistical Analysis of Computational Tests of Algorithms and Heuristics

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