Core instances for testing: a case study

DOI10.1016/j.ejor.2003.10.057zbMath1066.90064MaRDI QIDQ1779532

Monaldo Mastrolilli, Leonora Bianchi

Publication date: 1 June 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.057

zbMATH Keywords

Scheduling; Approximation algorithms; Optimization problems; Experimental analysis of algorithms; Testing methodology

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B90: Case-oriented studies in operations research

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the efficiency of polynomial time approximation schemes
• The one-machine sequencing problem
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• Designing and reporting on computational experiments with heuristic methods
• Testing heuristics: We have it all wrong
• On Isomorphisms and Density of $NP$ and Other Complete Sets
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Needed: An Empirical Science of Algorithms
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Smoothed analysis of algorithms