## 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,
✦ LIBER ✦
Improved Lagrangean decomposition: An application to the generalized assignment problem
✍ Scribed by Paulo Barcia; Kurt Jörnsten
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 573 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An application of lagrangean decompositi
✍
Monique Guignard; Moshe B. Rosenwein
📂
Article
📅
1990
🏛
John Wiley and Sons
🌐
English
⚖ 835 KB
An improved partial solution to the task
✍
Vangelis F Magirou
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 458 KB
A new approach to the nonlinear advectio
✍
Abdul-Majid Wazwaz
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 208 KB
An application of the lagrangean relaxat
✍
Sehun Kim; Minho Rhee
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 766 KB
An application of reflected diffusions t
✍
T.Ø Kobila
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 992 KB
An improved method for the generation of
✍
Nuria Sotomayor; Teresa Vicente; Esther Domínguez; Esther Lete; María-Jesús Vill
📂
Article
📅
1994
🏛
Elsevier Science
🌐
French
⚖ 984 KB
The one-not oreoaration of hindered 1%diawlethvlamines 3 and 4 and etbvlenenamides 5 is achieved vfa . . sodium cyanoborohydride reduction and acylation of thedeox;benzoin imines 2, respectively. A new methodology for the synthesis of 3arylisoquinolinium salts by the Bischler-Napieralski reaction of