Use of Representative Operation Counts in Computational Testing of Algorithms

DOI10.1287/IJOC.8.3.318MaRDI QIDQ5690268zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, James B. Orlin

Publication date 20 May 1997

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

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

zbMATH Keywords

CPU timerepresentative operation counts

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• A simple empirical formula for categorizing computing operations
• scientific article; zbMATH DE number 1857683
• scientific article; zbMATH DE number 3858841

Cited in

(5)

• A survey of the standard location-routing problem
• Computational investigations of maximum flow algorithms
• A simple empirical formula for categorizing computing operations
• Enhanced instance space analysis for the maximum flow problem
• A survey of variants and extensions of the location-routing problem

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Use of Representative Operation Counts in Computational Testing of Algorithms

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