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 published on a yearly basis
1 / 2
Papers
TL;DR: It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed.
Abstract: In the multiterminal cut problem one is given an edge-weighted graph and a subset of the vertices called terminals, and is asked for a minimum weight set of edges that separates each terminal from all the others. When the number $k$ of terminals is two, this is simply the mincut, max-flow problem, and can be solved in polynomial time. It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$. The planar problem is NP-hard, however, if $k$ is not fixed. A simple approximation algorithm for arbitrary graphs that is guaranteed to come within a factor of $2-2/k$ of the optimal cut weight is also described.
805 citations
TL;DR: In this paper, real-coded genetic algorithms (GAs) have been used to optimize truss-structures for finding optimal cross-sectional size, topology, and configuration of 2-D and 3-D trusses to achieve minimum weight.
399 citations
1 Mar 1973
TL;DR: In this paper, an efficient automated minimum weight design procedure is presented which is applicable to sizing structural systems that can be idealized by truss, shear panel, and constant strain triangles.
Abstract: An efficient automated minimum weight design procedure is presented which is applicable to sizing structural systems that can be idealized by truss, shear panel, and constant strain triangles. Static stress and displacement constraints under alternative loading conditions are considered. The optimization algorithm is an adaptation of the method of inscribed hyperspheres and high efficiency is achieved by using several approximation concepts including temporary deletion of noncritical constraints, design variable linking, and Taylor series expansions for response variables in terms of design variables. Optimum designs for several planar and space truss example problems are presented. The results reported support the contention that the innovative use of approximation concepts in structural synthesis can produce significant improvements in efficiency.
396 citations
TL;DR: A method is suggested to calculate the weight distributions of cosets of a code and a “dual concept” of that of perfect codes is presented and examined in detail.
Abstract: Starting from the distance distribution of an unrestricted code and its Mac Williams transform, one defines four parameters that, in the linear case, reduce to the minimum weight and the number of distinct weights of the given code and of its dual. In the general case, one exhibits the combinatorial meaning of these parameters and, using them, one obtains various results on the distance properties of the code. In particular, a method is suggested to calculate the weight distributions of cosets of a code. A “dual concept” of that of perfect codes is also presented and examined in detail.
346 citations
TL;DR: In this article, a method for optimal design of structures is presented based on an energy criteria and a search procedure for design of structural elements subjected to static loading, which can handle very efficiently, (a) design for multiple loading conditions, (b) stress constraints, (c) constraints on displacements, and (d) constraint on sizes of the elements.
310 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 6 |
| 2024 | 19 |
| 2023 | 29 |
| 2022 | 52 |
| 2021 | 54 |
| 2020 | 51 |