Pages that link to "Item:Q1001001"

The following pages link to Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001):

Displaying 20 items.

• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
• Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
• The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
• One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic (Q4921221) (← links)
• Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)