Phi-functions for 2D objects formed by line segments and circular arcs
From MaRDI portal
Publication:447557
DOI10.1155/2012/346358zbMath1246.90127DBLPjournals/advor/ChernovSRP12OpenAlexW2037738411WikidataQ58698818 ScholiaQ58698818MaRDI QIDQ447557
J. Herrera, D. Rodríguez-Gómez
Publication date: 4 September 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/346358
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (14)
Quasi-phi-functions and optimal packing of ellipses ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Packing ellipsoids into volume-minimizing rectangular boxes ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Optimal clustering of a pair of irregular objects ⋮ Packing ellipses in an optimized convex polygon ⋮ Combinatorial configurations in balance layout optimization problems ⋮ Irregular packing problems: a review of mathematical models ⋮ Optimized packing clusters of objects in a rectangular container ⋮ Balance layout problem for 3D-objects: mathematical model and solution methods ⋮ Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
Uses Software
Cites Work
- Covering a polygonal region by rectangles
- Tools of mathematical modeling of arbitrary object packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Rotational polygon overlap minimization and compaction
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- \(\Phi\)-functions for complex 2D-objects
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- An improved typology of cutting and packing problems
- Irregular Packing Using the Line and Arc No-Fit Polygon
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
This page was built for publication: Phi-functions for 2D objects formed by line segments and circular arcs
