𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lagrangian relaxation and pegging test for the clique partitioning problem

✍ Scribed by Noriyoshi Sukegawa, Yoshitsugu Yamamoto…

Book ID
120924861
Publisher
Springer-Verlag
Year
2013
Tongue
English
Weight
327 KB
Volume
7
Category
Article
ISSN
1862-5347

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangian relaxation for the star-star
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
✍ Andranik Mirzaian 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 673 KB

The star-star concentrator location problem (SSCLP), which is a network layout problem, is considered. SSCLP is formulated as an integer linear programming problem. The Lagrangian relaxation (LR) method is used to obtain suboptimal solutions (upper bounds) and lower bounds. Three different LRs are u