Pages that link to "Item:Q4658529"
From MaRDI portal
The following pages link to Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529):
Displaying 19 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)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- One-dimensional cutting stock problems and solution procedures (Q1197082) (← links)
- A new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Solving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning Objective (Q3583070) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
