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):
Displaying 50 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- 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)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach (Q1041932) (← 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 heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← 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)
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods (Q1979194) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- Kinetic models of conservative economies with need-based transfers as welfare (Q2176175) (← 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)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- A Novel Optimization in Guillotine Cut Applied Reel of Steel (Q3627713) (← 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)
