The following pages link to Cutting Stock Problems (Q5493630):
Displayed 16 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
- Projective Cutting-Planes (Q5221062) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)