Instance space analysis for 2D bin packing mathematical models

Cites Work

2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
Towards objective measures of algorithm performance across instance space
Generating new test instances by evolving in instance space
Scheduling inspired models for two-dimensional packing problems
An analytical model for the container loading problem
Instance spaces for machine learning classification
Measuring instance difficulty for combinatorial optimization problems
Testing heuristics: We have it all wrong
Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
Instance space analysis for a personnel scheduling problem
Relating instance hardness to classification performance in a dataset: a visual approach
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
A new class of hard problem instances for the 0-1 knapsack problem
Enhanced instance space analysis for the maximum flow problem
Instance space analysis and algorithm selection for the job shop scheduling problem
Exact solution of the two-dimensional finite bin packing problem
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
The Generation of Experimental Data for Computational Testing in Optimization
Two-Dimensional Finite Bin-Packing Algorithms
An Algorithm for Two-Dimensional Cutting Problems
Needed: An Empirical Science of Algorithms
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

This page was built for publication: Instance space analysis for 2D bin packing mathematical models