Instance space analysis for 2D bin packing mathematical models

Cites work

2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
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
An Algorithm for Two-Dimensional Cutting Problems
An analytical model for the container loading problem
Enhanced instance space analysis for the maximum flow problem
Exact solution of the two-dimensional finite bin packing problem
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Generating new test instances by evolving in instance space
Instance space analysis and algorithm selection for the job shop scheduling problem
Instance space analysis for a personnel scheduling problem
Instance spaces for machine learning classification
Measuring instance difficulty for combinatorial optimization problems
Needed: An Empirical Science of Algorithms
Relating instance hardness to classification performance in a dataset: a visual approach
Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
Scheduling inspired models for two-dimensional packing problems
Testing heuristics: We have it all wrong
The generation of experimental data for computational testing in optimization
Towards objective measures of algorithm performance across instance space
Two-Dimensional Finite Bin-Packing Algorithms
Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

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

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