On Method Overfitting

Authors:
Emanuel Falkenauer
Affiliations:
Applied Mechanics, CAD Unit, Brussels University (ULB), Av.F.D. Roosevelt 50, CP 165, B-1050 Brussels, Belgium. E-mail: efalkena@ulb.ac.be
Venue:
Journal of Heuristics
Year:
1998

Citing 4
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Solution of Open Bin Packing Problems

Journal of Heuristics

A Response to ’’On method overfitting‘‘

Journal of Heuristics
Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics

Journal of Heuristics
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Benchmark problems should be hard. True. Methods forsolving problems should be useful for more than just “beating”a particular benchmark. Truer still, we believe. In this paper,we examine the worthiness of the approach consisting of concentrationon a particular set of benchmark problems, an issue raised by arecent paper by Ian Gent. We find that such a methodology caneasily lead to publications of limited general use as far as ourability to solve practical problems is concerned.