๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational experience with general cutting planes for the Set Covering problem

โœ Scribed by Pasquale Avella; Maurizio Boccia; Igor Vasilyev

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
835 KB
Volume
37
Category
Article
ISSN
0167-6377

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

On a generalization of the Neumann probl
On a generalization of the Neumann problem for the Laplace equation outside cuts in a plane
โœ P. A. Krutitskii; A. O. Chikilev; N. Ch. Krutitskaya; V. V. Kolybasova ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 1 views

## Abstract A boundary value problem for harmonic functions outside cuts in a plane is considered. The jump of the normal derivative is specified on the cuts as well as a linear combination of the normal derivative on one side of the cut and the jump of the unknown function. The problem is studied