Core instances for testing: a case study

DOI10.1016/J.EJOR.2003.10.057MaRDI QIDQ1779532zbMATH OpenOpenAlexFDO

Authors 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

SchedulingApproximation algorithmsOptimization problemsExperimental analysis of algorithmsTesting methodology

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• scientific article; zbMATH DE number 1982188
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Generating new test instances by evolving in instance space
• Core problems in knapsack algorithms
• scientific article; zbMATH DE number 1569485

Cites work

• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2065615 (Why is no real title available?)
• scientific article; zbMATH DE number 2081111 (Why is no real title available?)
• scientific article; zbMATH DE number 1877047 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Approximation algorithms for NP-hard problems.
• Designing and reporting on computational experiments with heuristic methods
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Needed: An Empirical Science of Algorithms
• On Isomorphisms and Density of $NP$ and Other Complete Sets
• On the efficiency of polynomial time approximation schemes
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• Testing heuristics: We have it all wrong
• The one-machine sequencing problem

Cited in

(3)

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• scientific article; zbMATH DE number 1982188 (Why is no real title available?)
• Generating new test instances by evolving in instance space

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Core instances for testing: a case study

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