scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A polynomial-time algorithm is given that computes a triangulation compatible with S whose weight is at most a constant times the weight of any compatible triangulations.
Abstract: Let S be a set of noncrossing triangular obstacles in R3 with convex hull H . A triangulation T of H is compatible with S if every triangle of S is the union of a subset of the faces of T. The weight of T is the sum of the areas of the triangles of T. We give a polynomial-time algorithm that computes a triangulation compatible with S whose weight is at most a constant times the weight of any compatible triangulation.

23 citations

Journal ArticleDOI
TL;DR: The present computer program can derive optimal layouts for any polygonal domain with simply supported and/or clamped edges and internal point supports and the solution is valid for any nonnegative (downward) loading.

23 citations

Book ChapterDOI
14 Sep 2004
TL;DR: This paper gives an exact algorithm for constructing minimum-weight spanners in arbitrary graphs and experimentally evaluates the performance of the greedy algorithm for a set of realistic problem instances.
Abstract: Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching and message distribution in networks. These applications use some variant of the so-called greedy algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Greedy spanners have nice theoretical properties, but their practical performance with respect to total weight is unknown. In this paper we give an exact algorithm for constructing minimum-weight spanners in arbitrary graphs. By using the solutions (and lower bounds) from this algorithm, we experimentally evaluate the performance of the greedy algorithm for a set of realistic problem instances.

23 citations

Journal ArticleDOI
TL;DR: In this article, the minimum weight analysis for single loadings is presented, where geometric proportions have been obtained also in the examples for designs that are not minimum weight but are nearly minimum weight, allowing some flexibility in matching the mathematically ideal, minimum weight structural design requirements with practical design requirements.
Abstract: for the minimum weight formulations for single loadings The factors 771, 772, 773, will appear in Eq (5) as multiples of Young's modulus E and as ratios coupled to load ratios These details have been omitted here to simplify the presentation; readers interested in pursing the subject further should see Ref 5 Although emphasis has been placed on minimum weight analysis here, geometric proportions have been obtained also in the examples for designs that are not minimum weight but are nearly minimum weight Thus, the approach allows some flexibility in matching the mathematically ideal, minimum weight structural design requirements with practical design requirements Two assumptions have been made in the present article: 1) interaction equations based on tests of unstiffened components are applicable to stiffened components of minimum weight design and 2) there is no coupling between the modes of instability for each type of loading These assumptions require experimental investigation to determine their validity Although the present work is subject to modification because of these uncertainties, it does reveal trends, parameters, and potentials that are useful as guides in the design of efficient structures subjected to combined loads References

23 citations

Journal ArticleDOI
TL;DR: In this article, the optimal layup with least weight or cost for a symmetrically laminated plate subject to a buckling load is determined using a hybrid composite construction, which can meet the weight, cost and strength constraints while a non-hybrid construction may fail to satisfy the design requirements.
Abstract: The optimal layup with least weight or cost for a symmetrically laminated plate subject to a buckling load is determined using a hybrid composite construction. A hybrid construction provides further tailoring capabilities and can meet the weight, cost and strength constraints while a non-hybrid construction may fail to satisfy the design requirements. The objective of the optimization is to minimize either the weight or cost of the plate using the ply angles, layer thicknesses and material combinations as design variables. As the optimization problem contains a large number of continuous (ply angles and thicknesses) and discrete (material combinations) design variables, a -sequential solution procedure is devised in which the optimal variables are computed in different stages. The proposed design method is illustrated using graphite, kevlar and glass epoxy combinations and the efficiencies of the hybrid designs over the non-hybrid ones are computed.

23 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858