✦ LIBER ✦

Generating lower bounds for the prize collecting Steiner problem in graphs

✍ Scribed by Abilio Lucena; Mauricio Resende

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 262 KB
Volume: 7
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00227-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong lower bounds for the prize collec

Strong lower bounds for the prize collecting Steiner problem in graphs

✍ Abilio Lucena; Mauricio G.C Resende 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper, we present an integer programming formulation of the prize collecting Steiner problem in graphs (PCSPG) and describe an algorithm to obtain lower bounds for the problem. The algorithm is based on polyhedral cutting planes and is initiated with tests that attempt to reduce the size of

Local search with perturbations for the

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

✍ S. A. Canuto; M. G. C. Resende; C. C. Ribeiro 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

Reduction tests for the prize-collecting

Reduction tests for the prize-collecting Steiner problem

✍ Eduardo Uchoa 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

Generating lower bounds for the linear a

Generating lower bounds for the linear arrangement problem

✍ Weiguo Liu; Anthony Vannelli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 806 KB

An Algorithmic Framework for the Exact S

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

✍ Ivana Ljubić; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; M 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 369 KB