Pages that link to "Item:Q1847193"
From MaRDI portal
The following pages link to A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193):
Displayed 39 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← 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)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)
- Column Generation based Primal Heuristics (Q2883638) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry (Q3055414) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)