Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem

DOI10.1016/0377-2217(95)00038-0zbMath0916.90234OpenAlexW1968763460MaRDI QIDQ1268250

A. V. Kartashov, M. V. Novozhilova, Yu. G. Stoyan

Publication date: 7 March 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00038-0

zbMATH Keywords

packingcuttinggeometric designoptimal allocation of objects

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ Regular packing of congruent polygons on the rectangular sheet ⋮ Solution approaches to irregular nesting problems ⋮ Tools of mathematical modeling of arbitrary object packing problems ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Irregular packing problems: a review of mathematical models ⋮ Rotational polygon overlap minimization and compaction ⋮ A method of optimal lattice packing of congruent oriented polygons in the plane ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

Cites Work

• Packing problems
• A typology of cutting and packing problems
• Jostling for position: local improvement for irregular cutting patterns
• Two-dimensional Cutting Stock with Multiple Stock Sizes
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem