✦ LIBER ✦

Computing Approximate Solutions of the Maximum Covering Problem with GRASP

✍ Scribed by Mauricio G.C. Resende

Book ID: 110278491
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 140 KB
Volume: 4
Category: Article
ISSN: 1381-1231
DOI: 10.1023/a:1009677613792

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational experience with approximat

Computational experience with approximation algorithms for the set covering problem

✍ Tal Grossman; Avishai Wool 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

Minimum transversals of maximum matching

Minimum transversals of maximum matchings as approximate solutions to the bisection problem

✍ Th Andreae; H. -J. Bandelt 📂 Article 📅 1995 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 212 KB

On approximate solutions of the Graetz p

On approximate solutions of the Graetz problem with axial conduction

✍ C. Laohakul; C.Y. Chan; K.Y. Look; C.W. Tan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 512 KB

Hybrid Computer Solution of Optimal Cont

Hybrid Computer Solution of Optimal Control Problems by the Maximum Principle

✍ Miura, Takeo; Tsuda, Junji; Iwata, Junzo 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 995 KB

Analysis of the -EA for Finding Approxim

Analysis of the -EA for Finding Approximate Solutions to Vertex Cover Problems

✍ Oliveto, P.S.; Jun He; Xin Yao 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 886 KB

Comments on "Hybrid Computer Solution of

Comments on "Hybrid Computer Solution of Optimal Control Problems by the Maximum Principle"

✍ Rosko, J.S. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 342 KB