Pages that link to "Item:Q1326509"
From MaRDI portal
The following pages link to Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509):
Displayed 31 items.
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- Locomotive assignment with heterogeneous consists at CN North America (Q1278619) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- A branch-and-price algorithm for solving the cutting strips problem (Q1364894) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- Computational results with a primal-dual subproblem simplex method (Q1969761) (← links)
- A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
- Bi-dynamic constraint aggregation and subproblem reduction (Q2459403) (← 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)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Strategic capacity planning in supply chain design for a new market opportunity (Q4671255) (← links)
- Scenario-based approach for flexible resource loading under uncertainty (Q4671361) (← links)
- (Q4789079) (← links)
- A column generation approach for the maximal covering location problem (Q5449883) (← links)
- Integer programming approach to the printed circuit board grouping problem (Q5460557) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)