Beasley_SCP: J. E. Beasley instances of the set covering problem

In jmsallan/combheuristics: Heuristics for combinatorial problems

J. E. Beasley instances of the set covering problem

Description

A list containing 79 instances of the set covering problem included in the OR-Library maintained by J. R. Beasley.

Usage

Beasley_SCP

Format

A list containing 79 lists, named as in the original problem set. Each list has the following contents:

m

Number of sets of elements of the universe.

n

Numerber of elements of the universe.

costs

Cost of including a set to the solution.

instance

A data frame with all the pairs element - subset. Filtering by subset, we obtain the elements obtained in each subset.

Source

http://people.brunel.ac.uk/~mastjjb/jeb/orlib/scpinfo.html

Examples

Beasley_SCP$scp41

jmsallan/combheuristics documentation built on June 22, 2022, 4:11 p.m.