Pages that link to "Item:Q2643945"
From MaRDI portal
The following pages link to An improved typology of cutting and packing problems (Q2643945):
Displayed 50 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- Quasi-phi-functions and optimal packing of ellipses (Q288226) (← links)
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- The disruptive anti-covering location problem (Q320083) (← links)
- The multiple container loading problem with preference (Q320625) (← links)
- A heuristic algorithm for container loading of pallets with infill boxes (Q322963) (← links)
- Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A beam search approach to the container loading problem (Q336892) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts (Q339606) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- Ad hoc heuristic for the cover printing problem (Q435726) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- Phi-functions for 2D objects formed by line segments and circular arcs (Q447557) (← links)
- Mathematical modeling of distance constraints on two-dimensional \(\varphi\)-objects (Q466373) (← links)
- Trim loss optimization by an improved differential evolution (Q474531) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- A collision detection approach for maximizing the material utilization (Q493697) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)