Generating applicable synthetic instances for branch problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 15884
- scientific article; zbMATH DE number 912581
- Generating hard instances for robust combinatorial optimization
- Generation of Graphs with Bounded Branchwidth
- Generating instances for MAX2SAT with optimal solutions
- Efficient simulation of forward-branching systems with constructor systems
- Branch \& Sample: A simple strategy for constraint satisfaction
- scientific article; zbMATH DE number 2080330
- Simulation and optimization approaches to scenario tree generation
Cited in
(14)- Measuring instance difficulty for combinatorial optimization problems
- Parameter controlled instance generation for lot sizing problems
- Generation techniques for linear programming instances with controllable properties
- An overview of curriculum-based course timetabling
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- Synthetic optimization problem generation: show us the correlations!
- The generation of experimental data for computational testing in optimization
- 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
- Which algorithm to select in sports timetabling?
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Machine scheduling instance generation by reverse engineering from instance space analysis
This page was built for publication: Generating applicable synthetic instances for branch problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846416)
