Pages that link to "Item:Q1296373"

The following pages link to The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373):

Displaying 17 items.

• The combined cutting stock and lot-sizing problem in industrial processes (Q858391) (← links)
• Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
• The cutting stock problem for large sections in the iron and steel industries (Q1062609) (← links)
• A dynamic programming based heuristic for industrial buying of cardboard (Q1111922) (← links)
• Solving sequential interval cutting problems via dynamic programming (Q1197666) (← links)
• Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
• A method for the cutting stock problem with different qualities (Q1388928) (← links)
• Dynamic programming for delayed product differentiation. (Q1426701) (← links)
• Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
• An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244) (← links)
• A dynamic stochastic stock-cutting problem (Q2781110) (← links)
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
• Alternative approaches for one-dimensional slitting problems (Q4367019) (← links)
• Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems (Q4545662) (← links)
• (Q5152214) (← links)