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: It is proved that the problem with simple connectivity cannot be approximated better than the traveling salesman problem, in particular, the problem is APX-hard.
Abstract: Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of minimum weight with connectivity requirements. For the case of k-edge-connectedness, we present approximation algorithms that achieve constant approximation ratios for all d≥2⋅⌈k/2⌉. For the case of k-vertex-connectedness, we achieve constant approximation ratios for d≥2k−1. Our algorithms also work for arbitrary degree sequences if the minimum degree is at least 2⋅⌈k/2⌉ (for k-edge-connectivity) or 2k−1 (for k-vertex-connectivity). To complement our approximation algorithms, we prove that the problem with simple connectivity cannot be approximated better than the traveling salesman problem. In particular, the problem is APX-hard.

5 citations

Journal ArticleDOI
TL;DR: It is shown that a 2-change transformation can always be applied when k is even, and as a result, for k even, no two edges of a minimum weight k-connected network are crossing when the vertices are points in the Euclidean plane.

5 citations

01 Jan 2009
TL;DR: In this paper, a structural design method for the upper control arm installed at the rear side of a SUV is proposed, where the static strength of the control arm is considered in the optimization process and the inertia relief method for finite element analysis is utilized to simulate the static loading conditions.
Abstract: This study proposes a structural design method for the upper control arm installed at the rear side of a SUV. The weight of control arm can be reduced by applying the design and material technologies. In this research, the former includes optimization technology, and the latter the technologies for selecting aluminum as a steel-substitute material. Strength assessment is the most important design criterion in the structural design of a control arm. At the proto design stage of a new control arm, FE (finite element) analysis is often utilized to predict its strength. This study considers the static strength in the optimization process. The inertia relief method for FE analysis is utilized to simulate the static loading conditions. According to the classification of structural optimization, the structural design of a control arm is included in the category of shape optimization. In this study, the kriging interpolation method is adopted to obtain the minimum weight satisfying the strength constraint. Optimum designs are obtained by ANSYS WORKBENCH and the in-house program, EXCEL-kriging program. The optimum results determined from the in-house program are compared with those of ANSYS WORKBENCH.

5 citations

Journal ArticleDOI
TL;DR: In this paper, a minimum weight strut formulation for composite laminated struts is given, which satisfies failure criteria of local buckling, overall buckling and maximum strain or maximum stress.
Abstract: A formulation for minimum weight optimization of composite laminated struts is given. The minimum weight strut satisfies failure criteria of local buckling, overall buckling and maximum strain or maximum stress. Seven types of strut shapes, six composite materials and aluminium alloy are considered. The formulation requires the evaluation of the buckling coefficient, K, for both ends and one side simply supported and one side free for composite laminated plates of high aspect ratio, and the method of evaluation is also given. A computer program OPTSTRUT for carrying out the optimization procedure is described. Examples of strut design are carried out using this program and compared with existing designs. It was found that these results compared well with those from past investigators.

5 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