Pages that link to "Item:Q2003581"

The following pages link to Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581):

Displaying 14 items.

• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
• Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
• Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
• (Q5152214) (← links)
• Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries (Q6048506) (← links)
• Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
• Supply chain model having stochastic lead time demand with variable production rate and demand dependent on price and advertisement (Q6593940) (← links)