Minimum weight

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

Minimum Weight Design of Light Gage Steel Members

Abstract: Light gage steel is used extensively in light construction components. Large tonnages of a standard design are commonly produced, thus the minimum material requirements are of utmost importance to the product designer. A technique is presented for designing a minimum weight member to support a given loading condition. The problem is treated as a numerical optimization problem in which the variables are the dimensions and thickness of a given type of cross-sectional shape. Design requirements are based on the American Iron and Steel Institute Specification for the Design of Cold-Formed Steel Structural Members, 1968 Edition. These requirements are used to calculate a minimum acceptable thickness for a section whose other dimensions are considered temporarily fixed. This establishes the minimum weight design for the particular set of dimensions. Search methods are then employed to systematically establish sets of dimensions yielding reduced weight sections. Both a direct search and gradient search were examined and the latter found to be more efficient.

Determining Shortest Paths between Two Arbitrary Nodes in a Composite Transport Network Using Segment Routing

Abstract: The task of finding the optimal shortest path is a key task in routing, and new drivers of the development of data transmission technologies require improvements in devices, services and technologies, in particular, in order to adapt existing algorithms and methods for finding shortest paths for segment routing problems. In this case, the key element of determining the shortest path is the metric. Since determining the shortest paths is an important step in forming a composite path within segment routing, determining the correct metric has a strong impact on this process. Segment routing represents an important evolutionary step forward in the design, management and operation of modern transport networks, including the global Internet. This paper considers the possibility of determining the optimal paths between two arbitrary nodes in a composite network using the segment routing methodology. Discusses the relevance of the problem, the issues of determining the minimum path weight, the path with the minimum weight, achieving the minimum delay, determination of the shortest path with segmentation and the problem of the minimum delay path in the segment routing.

Minimum-weight design of sandwich shells subjected to fixed and moving loads

Abstract: This paper is concerned with the minimum-weight design of sandwich shells. The core thickness is known and the thickness of the face sheets, which are composed of a perfectly plastic material, is to be determined. For the case of a single set of loads acting on a plate, a procedure for obtaining the absolute minimum volume of the face sheets was given by Drucker and Shield [1], minimum volume coinciding with minimum weight for homogeneous materials. The procedure was later extended to the design of shells by Shield [2] and then to the case of multiple loading [3], that is when the structure is required to support separately two or more systems of loads. Independently Gross and Prager [4] have obtained the minimum-weight design of a beam under a single concentrated moving load and recently Save and Prager [5] extended this procedure to beams subjected simultaneously to fixed and moving loads. It was found that in some cases a superposition method could be used.

Approximating the girth

Abstract: This paper considers the problem of computing a minimum weight cycle in weighted undirected graphs. Given a weighted undirected graph G(V,E,w), let C be a minimum weight cycle of G, let w(C) be the weight of C and let wmax (C) be the weight of the maximal edge of C. We obtain three new approximation algorithms for the minimum weight cycle problem:1. For integral weights from the range [1, M] an algorithm that reports a cycle of weight at most 4/3w(C) in O(n2 log n(log n + log M)) time.2. For integral weights from the range [1, M] an algorithm that reports a cycle of weight at most w(C) + wmax (C) in O(n2 log n(log n + log M)) time.3. For non-negative real edge weights an algorithm that for any e > 0 reports a cycle of weight at most (4/3 + e)w(C) in O(1/e n2 log n(log log n)) time.In a recent breakthrough Vassilevska Williams and Williams [WW10] showed that a subcubic algorithm that computes the exact minimum weight cycle in undirected graphs with integral weights from the range [1, M] implies a subcubic algorithm for computing all-pairs shortest paths in directed graphs with integral weights from the range [− M, M]. This implies that in order to get a subcubic algorithm for computing a minimum weight cycle we have to relax the problem and to consider an approximated solution.Lingas and Lundell [LL09] were the first to consider approximation in the context of minimum weight cycle in weighted graphs. They presented a 2-approximation algorithm for integral weights with O(n2 log n(log n + log M)) running time. They also posed as an open problem the question whether it is possible to obtain a subcubic algorithm with a c-approximation, where c