Core instances for testing: a case study

DOI10.1016/J.EJOR.2003.10.057zbMATH Open1066.90064OpenAlexW1992124278MaRDI QIDQ1779532FDOQ1779532

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

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

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)

Cites Work

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

Cited In (3)

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Title not available (Why is that?)
• Generating new test instances by evolving in instance space

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)