✦ LIBER ✦

Experiments with parallel branch-and-bound algorithms for the set covering problem

✍ Scribed by Russell A. Rushmeier; George L. Nemhauser

Book ID: 107918264
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 773 KB
Volume: 13
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(93)90050-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two branch-and-bound algorithms for the

Two branch-and-bound algorithms for the robust parallel machine scheduling problem

✍ Mohammad Ranjbar; Morteza Davari; Roel Leus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB

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

A parallel branch and bound algorithm fo

A parallel branch and bound algorithm for the quadratic assignment problem

✍ Catherine Roucairol 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 746 KB

A set-covering problem: the combinatoria

A set-covering problem: the combinatorial-local approach and the branch and bound method

✍ Yu.A. Zuev 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 890 KB

A branch-and-bound algorithm for impleme

A branch-and-bound algorithm for implementing set covering model expert systems

✍ William Leigh; Dia Ali; Cloyd Ezell; Noemi Paz 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 190 KB

An upper bound for the speedup of parall

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB