Pages that link to "Item:Q1847180"
From MaRDI portal
The following pages link to A 2-exchange heuristic for nesting problems (Q1847180):
Displaying 30 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← 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)
- Two-dimensional profile-packing approach for multi-torch flame cutting (Q3605412) (← links)
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm (Q5438623) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)