𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A CAD approach to the minimum weight design problem

✍ Scribed by Björn J. D. Esping

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
492 KB
Volume
21
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear programming approach to increas
A linear programming approach to increasing the weight of all minimum spanning trees
✍ Mourad Baïou; Francisco Barahona 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

## Abstract Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. Frederickson and Solis‐Oba gave an

A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
✍ 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.