A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
From MaRDI portal
Publication:5199760
Recommendations
- An algorithm of global optimization for solving layout problems
- scientific article; zbMATH DE number 238410
- scientific article; zbMATH DE number 1192964
- The layout problem of two kinds of graph elements with performance constraints and its optimality conditions
- Local Search Algorithms for the Maximal Planar Layout Problem
Cited in
(7)- scientific article; zbMATH DE number 1192964 (Why is no real title available?)
- scientific article; zbMATH DE number 238410 (Why is no real title available?)
- Ant colony optimization and heuristic algorithms for rectangle layout optimization problem with equilibrium constraints
- A Local Optimization-based Solution to the Rectangle Layout Problem
- The layout problem of two kinds of graph elements with performance constraints and its optimality conditions
- An emergent computation approach to the problem of polygon layout with performance constraints
- An algorithm of global optimization for solving layout problems
This page was built for publication: A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199760)