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 basis change strategy within the reduced gradient method for optimization under linear constraints that ensures a non-singular basis matrix at every iteration is proposed, exploiting the sparsity of the constraint Jacobian matrix.
Abstract: This paper proposes a basis change strategy within the reduced gradient method for optimization under linear constraints. It ensures a non-singular basis matrix at every iteration. The same strategy can reliably be used within the generalized reduced gradient method for optimization under non-linear constraints. This method is applied to the minimum weight design of large structures under displacement and stress constraints, exploiting the sparsity of the constraint Jacobian matrix.

7 citations

Journal ArticleDOI
TL;DR: In this paper, the authors considered the problem of minimizing the mass of vibrating cantilevers whose fundamental frequencies of natural vibrations in longitudinal and transverse modes exceed prescribed values, and proposed solutions for members whose cross-section is of solid construction.

7 citations

Journal ArticleDOI
TL;DR: In this paper, the authors consider the general problem of finding the minimum weight b-matching on arbitrary graphs and prove that, whenever the linear programming relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution for synchronous and asynchronous updating.
Abstract: We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating.

7 citations

Journal ArticleDOI
TL;DR: This work studies the locating-dominating set problem from a polyhedral point of view and demonstrates how the associated polyhedra can be entirely described for some basic families of graphs, to determine minimum weight locating-Dominating sets in the studied graph classes for arbitrary integral node weights.

7 citations

Journal ArticleDOI
TL;DR: In this article, a methodology is developed by which one may design a stiffened cylinder of specified material, radius and length such that it can carry safely a given hydrostatic pressure which minimum weight.
Abstract: A methodology is developed by which one may design a stiffened cylinder of specified material, radius and length such that it can carry safely a given hydrostatic pressure which minimum weight. The solution is accomplished in two stages. First, design charts based on a simplified formulation of the objective function are obtained. Second, these design charts are used to evaluate the design variables. Such an approach enables the designer to introduce needed changes or avoid interaction of failure modes by paying the least weight penalty. Design examples are presented and the results are compared with those obtained by other investigators.

7 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