Pages that link to "Item:Q2899044"

The following pages link to An inexact bundle approach to cutting-stock problems (Q2899044):

Displaying 12 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
• Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• Comparison of bundle and classical column generation (Q2476993) (← links)
• Column generation based primal heuristics (Q2883638) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)