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
Papers
More filters
TL;DR: This work provides a new efficient algorithm that works for a wide class of hyperpath weight measures and explicitly updates minimum weight hyperpaths in O(L · C + max{n, C· size(H))) worst case time under a sequence of L hyperarc weight increments and hyperarc deletions.
7 citations
TL;DR: This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality triangulations and pseudo-triangulations of minimum weight.
Abstract: Globally optimal triangulations and pseudo-triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) and Minimum Weight Pseudo-Triangulation (MWPT) problems of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality triangulations and pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWT and MWPT problems since no reference to benchmarks for these problems were found in the literature. Through the experimental evaluation, we assess the applicability of the ACO metaheuristic for MWT and MWPT problems considering greedy and Simulated Annealing algorithms.
7 citations
TL;DR: In this article, the authors demonstrate the application of ideal forming theory to design sheet stretching processes that can produce the optimum shapes and thickness distributions from flat sheets of uniform thickness for axisymmetric thin-walled structures.
7 citations
01 Jan 1976
TL;DR: In this article, the minimum weight design of multistory, multispan plane building frames subject to foundation reaction constraints is studied and a general, analytical and explicit constructive law with exact solutions can be derived for a broad class of frames of practical interest subject to compressive reaction constraints only.
Abstract: This paper presents the necessary and sufficient conditions for the minimum weight design of multistory, multispan plane building frames subject to foundation reaction constraints It proposes a general, analytical, and explicit constructive law with which exact solutions can be derived for a broad class of frames of practical interest subject to compressive reaction constraints only It is proved that the classical Foulkes mechanism must be modified for this problem so as to include artificial settlements and/or upward displacements wherever the reactions attain the prescribed limiting values The bay shear distribution law compactly expressed in terms of the enlarged and reduced span lengths defined in this paper clarifies the general features of the minimum weight design
7 citations
TL;DR: A strongly polynomial primal-dual algorithm that finds a minimum weight bibranching in O(n′(m+nlog n) time (where n:=|VG|, m: =|AG|, n′:=min (|S|,|T|)).
Abstract: Let G=(VG,AG) be a digraph and let S ⊔ T be a bipartition of VG. A bibranching is a subset B⊆AG such that for each node s∈S there exists a directed s–T path in B and, vice versa, for each node t∈T there exists a directed S–t path in B.
Bibranchings generalize both branchings and bipartite edge covers. Keijsper and Pendavingh proposed a strongly polynomial primal-dual algorithm that finds a minimum weight bibranching in O(n′(m+nlog n)) time (where n:=|VG|, m:=|AG|, n′:=min (|S|,|T|)).
Assuming that arc weights are integers we develop a weight-scaling algorithm of time complexity $O(m\sqrt{n}\;\log n\log(nW))$ for the minimum weight bibranching problem (where W denotes the maximum magnitude of arc weights).
7 citations