Pages that link to "Item:Q1919356"
From MaRDI portal
The following pages link to Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356):
Displayed 23 items.
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)