Pages that link to "Item:Q1592584"
From MaRDI portal
The following pages link to The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584):
Displaying 27 items.
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- A measure of non-convexity in the plane and the Minkowski sum (Q603859) (← links)
- Irregular stock cutting system based on AutoCAD (Q654369) (← links)
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← 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)
- An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
- The geometry of nesting problems: a tutorial (Q2384608) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← 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)
- Irregular Packing Using the Line and Arc No-Fit Polygon (Q3098287) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← 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)
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
