On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions

DOI10.1016/J.IPL.2018.11.003zbMath1478.68467arXiv1902.00101OpenAlexW2901793026WikidataQ128989099 ScholiaQ128989099MaRDI QIDQ1711419

Iago A. Carvalho

Publication date: 18 January 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00101

zbMATH Keywords

analysis of algorithmsstatistical inferenceinfeasibilitydata preprocessinglexicographical ranking

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Paired and multiple comparisons; multiple testing (62J15) Algorithms in computer science (68W99)

Related Items (3)

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty

Uses Software

• FEASPUMP
• ASlib

Cites Work

• Unnamed Item
• ASlib: a benchmark library for algorithm selection
• A recipe for finding good solutions to MINLPs
• The minimum spanning tree problem with non-terminal set
• Integrality gap minimization heuristics for binary mixed integer nonlinear programming
• 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
• Improved formulations for minimum connectivity network interdiction problems
• Joint analysis of multiple algorithms and performance measures
• A fast algorithm for the gas station problem
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• Rounding-based heuristics for nonconvex MINLPS

This page was built for publication: On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions