solvers

package
v0.0.0-...-dead5c0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Nov 1, 2023 License: AGPL-3.0 Imports: 4 Imported by: 0

Documentation

Overview

A brute force solver for the "Weighted Exact Cover Problem".

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

func MakeInstance

func MakeInstance(m int, subsets [][]int, costs []float64) (instance, error)

Make an Instance and check the constraints that an Instance should satisfy.

func SolveByBruteForce

func SolveByBruteForce(ins instance) (subsetsEval, error)

SolveByBruteForce attempts finds a minimum cost exact cover for an instance.

If a minimum cost exact cover exists, the returned subsetsEval will contain indices to this cover and its exactlyCovered flag will be true. Otherwise, the zero value of subsetEval will be returned.

Types

This section is empty.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL