Designing and reporting on computational experiments with heuristic methods
Authors:
- 1 September 1995
- journal article
- research article
- Published by Springer Nature in Journal of Heuristics
- Vol. 1 (1) , 9-32
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutionsNetworks, 1994
- Large-scale controlled rounding using tabu search with strategic oscillationAnnals of Operations Research, 1993
- Cell suppression: Disclosure protection for sensitive tabular dataNetworks, 1992
- Analyzing algorithms by simulationACM Computing Surveys, 1992
- Generating Travelling-Salesman Problems with Known Optimal ToursJournal of the Operational Research Society, 1988
- A statistical technique for comparing heuristics: an example from capacity assignment strategies in computer network designCommunications of the ACM, 1987
- Accelerated branch exchange heuristics for symmetric traveling salesman problemsNetworks, 1987
- On Reporting Computational Experiments with Mathematical SoftwareACM Transactions on Mathematical Software, 1979
- Development of a Parametric Generating Procedure for Integer Programming Test ProblemsJournal of the ACM, 1977