Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
From MaRDI portal
Cited in
(4)- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem
- Filtered beam search algorithm for the two-dimensional rectangular packing problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
This page was built for publication: Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6446808)