๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for the minimum weight design of a telescopic jib

โœ Scribed by Zenon Nowak; Witold Pogorzelski


Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
602 KB
Volume
8
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A CAD method for minimum weight design o
โœ R Bos ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

This paper describes a 2ยฝD site model constructed from randomly scattered data points. The model is based on the subdivision of the xy plane known as the Dirichlet tessellation and its data structure is a computer representation of the related Delaunay triangulation. Applications of the site model a

A branch-and-cut algorithm for the resou
โœ Fischetti, Matteo; Vigo, Daniele ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.