A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
From MaRDI portal
Publication:5199760
zbMATH Open1228.90141MaRDI QIDQ5199760FDOQ5199760
Authors: Jingang Zhai, Jiao-Jun Zhang
Publication date: 16 August 2011
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
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)
Cited In (5)
- An algorithm of global optimization for solving layout problems
- A Local Optimization-based Solution to the Rectangle Layout Problem
- Ant colony optimization and heuristic algorithms for rectangle layout optimization problem with equilibrium constraints
- Title not available (Why is that?)
- The layout problem of two kinds of graph elements with performance constraints and its optimality conditions
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)