Design of planar articulated mechanisms using branch and bound
From MaRDI portal
(Redirected from Publication:1780959)
Recommendations
- Articulated mechanism design with a degree of freedom constraint
- 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
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Path-generation of articulated mechanisms by shape and topology variations in non-linear truss representation
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 2038815 (Why is no real title available?)
- scientific article; zbMATH DE number 1534301 (Why is no real title available?)
- scientific article; zbMATH DE number 954281 (Why is no real title available?)
- scientific article; zbMATH DE number 774556 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A New Method for Optimal Truss Topology Design
- A bilinear approach to the pooling problem†
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A symmetry extension of Maxwell's rule for rigidity of frames
- Advanced preprocessing techniques for linear and quadratic programming
- Articulated mechanism design with a degree of freedom constraint
- Buckminster fuller's tensegrity structures and Clerk Maxwell's rules for the construction of stiff frames
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Equivalent displacement based formulations for maximum strength truss topology design
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Modelling topology optimization problems as linear mixed 0-1 programs
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Optimal Truss Design by Interior-Point Methods
- Optimal design of trusses under a nonconvex global buckling constraint
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolving in linear programming
- Robust Truss Topology Design via Semidefinite Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite Programming
- Synthesis of mechanisms using time-varying dimensions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(9)- Optimum exact/approximate point synthesis of planar mechanisms
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Articulated mechanism design with a degree of freedom constraint
- Topology optimization of planar linkage mechanisms
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Optimum dimensional synthesis of planar mechanisms with geometric constraints
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- Modeling and optimal design of neuro-mechanical shape memory devices
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
This page was built for publication: Design of planar articulated mechanisms using branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780959)
