Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
From MaRDI portal
Publication:849084
DOI10.1007/s10589-007-9152-7zbMath1184.90110OpenAlexW2038873290WikidataQ56050732 ScholiaQ56050732MaRDI QIDQ849084
Wolfgang Achtziger, Mathias Stolpe
Publication date: 24 February 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9152-7
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (14)
Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems ⋮ Bridging mixed integer linear programming for truss topology optimization and additive manufacturing ⋮ Discrete multi-load truss sizing optimization: model analysis and computational experiments ⋮ Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples ⋮ Global optimization of robust truss topology via mixed integer semidefinite programming ⋮ A hybrid cooperative search algorithm for constrained optimization ⋮ Global optima for the Zhou-Rozvany problem ⋮ A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints ⋮ A new branch and bound method for a discrete truss topology design problem ⋮ Topology optimization of adaptive structures: new limits of material economy ⋮ Truss topology optimization with discrete design variables by outer approximation ⋮ Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems ⋮ Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach ⋮ Towards a lifecycle oriented design of infrastructure by mathematical optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Genetic algorithms in truss topological optimization
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- Design of planar articulated mechanisms using branch and bound
- An Automatic Method of Solving Discrete Programming Problems
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Robust Truss Topology Design via Semidefinite Programming
- Modified trajectory method for practical global optimization problems
- Modelling topology optimization problems as linear mixed 0-1 programs
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
This page was built for publication: Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results