Statistical Analysis of Computational Tests of Algorithms and Heuristics

DOI10.1287/ijoc.12.1.24.11899zbMath1034.90020OpenAlexW2062450536MaRDI QIDQ4427318

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)

Related Items (12)

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 ⋮ Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization ⋮ Log transformations: What not to expect when you’re expecting ⋮ Poisoning finite-horizon Markov decision processes at design time ⋮ On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ Group-scheduling problems in electronics manufacturing ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ Hybridizations of GRASP with path relinking for the far from most string problem ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach

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