𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The -Cardinality Tree Problem: Reformulations and Lagrangian Relaxation

✍ Scribed by Frederico P. Quintão; Alexandre Salles da Cunha; Geraldo R. Mateus; Abilio Lucena

Book ID
108112804
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
411 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search algorithms for the k-cardin
Local search algorithms for the k-cardinality tree problem
✍ Christian Blum; Matthias Ehrgott 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th

Lagrangian relaxation approach to the ta
Lagrangian relaxation approach to the targeting problem
✍ Ojeong Kwon; Donghan Kang; Kyungsik Lee; Sungsoo Park 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

In this paper, we consider a new weapon-target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model. We applied Lagrangian relaxation and a branch-and-bound method to the problem after transforming the nonline