Pages that link to "Item:Q2884549"
From MaRDI portal
The following pages link to Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results (Q2884549):
Displaying 30 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- A branch-and-price algorithm for solving the cutting strips problem (Q1364894) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Optimal solutions for the cutting stock problem (Q1825768) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
- An linear programming based lower bound for the simple assembly line balancing problem (Q2569061) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- Optimal Integer Solutions to Industrial Cutting Stock Problems (Q4427384) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
