Design of planar articulated mechanisms using branch and bound
type: Item
instance of: scholarly article
title: Design of planar articulated mechanisms using branch and bound
zbMATH Open document ID: 1066.70006
author: Mathias Stolpe
author: Atsushi Kawamoto
published in: Mathematical Programming. Series A. Series B
publication date: 2005-06-14T00:00:00Z
Mathematics Subject Classification ID: 70E60
Mathematics Subject Classification ID: 70B15
Mathematics Subject Classification ID: 74P10
Mathematics Subject Classification ID: 74K10
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 2175967
zbMATH Keywords: optimization
zbMATH Keywords: elastic stability
zbMATH Keywords: convex relaxations
Wikidata QID: Q56050752
describes a project that uses: SNOPT
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s10107-005-0586-3
OpenAlex ID: W2068011066
cites work: Equivalent displacement based formulations for maximum strength truss topology design
cites work: Jointly constrained bilinear programs and related problems: An overview
cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation
cites work: Jointly Constrained Biconvex Programming
cites work: Presolving in linear programming
cites work: A New Method for Optimal Truss Topology Design
cites work: Optimal design of trusses under a nonconvex global buckling constraint
cites work: Potential Reduction Polynomial Time Method for Truss Topology Design
cites work: Robust Truss Topology Design via Semidefinite Programming
cites work: Q4517110
cites work: Q4839162
cites work: Q4449265
cites work: Optimal Design of Truss Structures by Logic-Based Branch and Cut
cites work: Buckminster fuller's ''tensegrity'' structures and Clerk Maxwell's rules for the construction of stiff frames
cites work: Q4718469
cites work: A bilinear approach to the pooling problem†
cites work: A symmetry extension of Maxwell's rule for rigidity of frames
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Synthesis of mechanisms using time-varying dimensions
cites work: Q3997222
cites work: Optimal Truss Design by Interior-Point Methods
cites work: Articulated mechanism design with a degree of freedom constraint
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Advanced preprocessing techniques for linear and quadratic programming
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: A branch-and-reduce approach to global optimization
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
cites work: Modelling topology optimization problems as linear mixed 0-1 programs
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Semidefinite Programming
cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
DOI: 10.1007/S10107-005-0586-3
description: scientific article; zbMATH DE number 2175967