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 50 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- 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 new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← 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)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
- Theoretical treatment of target coverage in wireless sensor networks (Q2434517) (← 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)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- The Fixed-Charge Shortest-Path Problem (Q2815469) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← 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)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← 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)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- (Q5020878) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)