Pages that link to "Item:Q4212712"
From MaRDI portal
The following pages link to Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712):
Displaying 27 items.
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria (Q1026554) (← links)
- Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171) (← 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)
- Improving competitiveness in veneers production by a simple-to-use DSS. (Q1426707) (← 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)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- An exact model for a slitting problem in the steel industry (Q2239876) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Scheduling training for a tank battalion: how to measure readiness (Q2462532) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- (Q3691401) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667) (← links)
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529) (← links)
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints (Q5326765) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)