Pages that link to "Item:Q1380722"

The following pages link to Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722):

Displaying 37 items.

• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
• 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)
• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← links)
• On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
• Branching in branch-and-price: A generic scheme (Q652288) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← 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)
• Algorithms for the variable sized bin packing problem (Q1869719) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
• Decomposition methods for the lot-sizing and cutting-stock problems in paper industries (Q2293861) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• A note on the approximability of cutting stock problems (Q2643962) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Column-Generation in Integer Linear Programming (Q4450558) (← links)
• O problema de corte de estoque em indústrias de móveis de pequeno e médio portes (Q4905623) (← links)
• Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)