Pages that link to "Item:Q2576248"

The following pages link to A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248):

Displaying 50 items.

• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Integer linear programming models for the skiving stock problem (Q322686) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
• An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
• A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
• On the cutting stock problem under stochastic demand (Q610975) (← links)
• A note on branch-and-cut-and-price (Q613321) (← 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)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
• The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• Branch-and-price algorithms for the one-dimensional cutting stock problem (Q1380722) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← 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 combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution (Q2029369) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
• Friendly bin packing instances without integer round-up property (Q2340275) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← 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)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• Cutting planes for branch-and-price algorithms (Q3113514) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)