𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition techniques for the minimum toll revenue problem

✍ Scribed by Lihui Bai; Donald W. Hearn; Siriphong Lawphongpanich

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
126 KB
Volume
44
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An application of lagrangean decompositi
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
✍ Monique Guignard; Moshe B. Rosenwein 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB

## Abstract The resource‐constrained minimum weighted arborescence problem, a 0‐1 integer programming model with application in hierarchical distribution network design, is introduced. Since the model is NP‐hard, an enumeration method is required to solve it to optimality. Lagrangean decomposition,

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen