New branch and bound approaches for truss topology design with discrete areas
From MaRDI portal
Publication:3178032
zbMATH Open1341.74139MaRDI QIDQ3178032FDOQ3178032
Authors: Adelaide Cerveira, Agostinho Agra, Fernanda Bastos, Joaquim A. S. Gromicho 
Publication date: 8 July 2016
Recommendations
- A new branch and bound method for a discrete truss topology design problem
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Semidefinite programming (90C22) Topological methods for optimization problems in solid mechanics (74P15)
Cited In (7)
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- A new branch and bound method for a discrete truss topology design problem
- Truss topology optimization with discrete design variables by outer approximation
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
This page was built for publication: New branch and bound approaches for truss topology design with discrete areas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178032)
