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: PANDA2 as mentioned in this paper is a computer program for minimum weight design of composite, stiffened cylindrical or flat panels made of composite material with axial compression, inplane shear, and normal pressure.

19 citations

Book ChapterDOI
17 Dec 1997
TL;DR: This paper investigates a branch-and-cut approach for minimum weight triangulation of n points in the plane and uses a cut induced by geometric properties of triangulations to solve the moderate-size problem.
Abstract: This paper considers the problem of computing a minimum weight triangulation of n points in the plane, which has been intensively studied in recent years in computational geometry. This paper investigates a branch-and-cut approach for minimum weight triangulations. The problem can be formulated as finding a minimum-weight maximal independent set of intersection graphs of edges. In combinatorial optimization, there are known many cuts for the independent set problem, and we further use a cut induced by geometric properties of triangulations. Combining this branch-and-cut approach with the β-skeleton method, the moderate-size problem could be solved efficiently in our computational experiments. Polyhedral characterizations of the proposed cut and applications of another old skeletal approach in mathematical programming as the independent set problem are also touched upon.

19 citations

Journal ArticleDOI
TL;DR: In this paper, a method for the minimum weight design of structural systems subject to performance constraints imposed at both the service and ultimate loading levels is developed for structural systems for which stiffness and strength properties are linear functions of the transverse sizes of the elements.

19 citations

Journal ArticleDOI
TL;DR: This work proposes three linear programming formulations for BCP k, the first of which contains only binary variables and a potentially large number of constraints that can be separated in polynomial time in the corresponding linear relaxation.

19 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