Pages that link to "Item:Q858412"
From MaRDI portal
The following pages link to Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412):
Displaying 28 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- A measure of non-convexity in the plane and the Minkowski sum (Q603859) (← links)
- Tools of mathematical modeling of arbitrary object packing problems (Q610987) (← links)
- Irregular stock cutting system based on AutoCAD (Q654369) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
- An emergent computation approach to the problem of polygon layout with performance constraints (Q1673263) (← links)
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues (Q1991289) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
- An improved method for calculating the no-fit polygon (Q2581595) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
- Irregular Packing Using the Line and Arc No-Fit Polygon (Q3098287) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- (Q5150600) (← links)
- The irregular nesting problem: a new approach for nofit polygon calculation (Q5429840) (← links)
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations (Q6068729) (← links)
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems (Q6572836) (← links)
- How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem (Q6586244) (← links)
