Pages that link to "Item:Q1869576"

The following pages link to One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576):

Displaying 30 items.

• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (Q319143) (← links)
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
• Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
• On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
• In situ column generation for a cutting-stock problem (Q868997) (← links)
• New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
• An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
• Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
• An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
• Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← 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)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
• The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
• Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934) (← links)
• On LP relaxations for the pattern minimization problem (Q3008919) (← links)
• (Q3147525) (← links)
• A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
• Optimal job splitting on a multi-slot machine with applications in the printing industry (Q3553743) (← links)
• Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm (Q3612895) (← 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)