Generating Applicable Synthetic Instances for Branch Problems
From MaRDI portal
Publication:2846416
DOI10.1287/opre.2013.1169zbMath1273.90243OpenAlexW2109670967WikidataQ62033359 ScholiaQ62033359MaRDI QIDQ2846416
Leo Lopes, Kate A. Smith-Miles
Publication date: 5 September 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2013.1169
Related Items (7)
Towards objective measures of algorithm performance across instance space ⋮ Generating new test instances by evolving in instance space ⋮ The international timetabling competition on sports timetabling (ITC2021) ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations ⋮ An overview of curriculum-based course timetabling
Uses Software
This page was built for publication: Generating Applicable Synthetic Instances for Branch Problems
