Designing and reporting on computational experiments with heuristic methods
type: Item
instance of: scholarly article
title: Designing and reporting on computational experiments with heuristic methods
zbMATH Open document ID: 0853.68154
DOI: 10.1007/BF02430363
author: Mauricio G. C. Resende
author: William R. jun. Stewart
author: Richard S. Barr
author: Bruce Golden
author: James Kelly
published in: Journal of Heuristics
publication date: 1996-09-01T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 922544
zbMATH Keywords: computational testing
zbMATH Keywords: test heuristic method
describes a project that uses: TSPLIB
describes a project that uses: DIMACS
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling
cites work: Q3056948
cites work: Network Reoptimization Algorithms: A Statistically Designed Comparison
cites work: Generating Travelling-Salesman Problems with Known Optimal Tours
cites work: An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
cites work: Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
cites work: Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
cites work: Nelder-Mead Simplex Modifications for Simulation Optimization
cites work: Simulated annealing and tabu search in the long run: A comparison on QAP tasks
cites work: Q4283439
cites work: Q4386496
cites work: Q3662646
cites work: A comparison of heuristics and relaxations for the capacitated plant location problem
cites work: A simple heuristic for the p-centre problem
cites work: Greedy randomized adaptive search procedures
cites work: Worst-Case Analysis of Heuristic Algorithms
cites work: A collection of test problems for constrained global optimization algorithms
cites work: Q4198056
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Tabu Search—Part I
cites work: A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
cites work: Experimentation in optimization
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: A Best Possible Heuristic for the k-Center Problem
cites work: Q4079017
cites work: Needed: An Empirical Science of Algorithms
cites work: Testing heuristics: We have it all wrong
cites work: ``Neural'' computation of decisions in optimization problems
cites work: A critical review of comparisons of mathematical programming algorithms and software (1953-1977)
cites work: Q4038710
cites work: Cell suppression: Disclosure protection for sensitive tabular data
cites work: Large-scale controlled rounding using tabu search with strategic oscillation
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Tabu search performance on the symmetric travelling salesman problem
cites work: Q5187226
cites work: Development of a Parametric Generating Procedure for Integer Programming Test Problems
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3993418
cites work: Q4417314
cites work: Q4724708
cites work: Feature Article—Toward an Experimental Method for Algorithm Simulation
cites work: Q3339582
cites work: Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
cites work: A Simplex Method for Function Minimization
cites work: Neural Networks for Selective Vehicle Routing Heuristics
cites work: Q4495496
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A GRASP for graph planarization
cites work: Accelerated branch exchange heuristics for symmetric traveling salesman problems
cites work: Heuristic methods and applications: A categorized survey
description: scientific article; zbMATH DE number 922544