Struct SubsetSum 

pub struct SubsetSum { /* private fields */ }

The Subset Sum problem.

Given a set of n integers and a target B, determine whether there exists a subset whose elements sum to exactly B.

Representation

Each element has a binary variable: x_i = 1 if element i is selected, 0 otherwise. The problem is satisfiable iff ∑_{i: x_i=1} sizes[i] == target.

Example

use problemreductions::models::misc::SubsetSum;
use problemreductions::{Problem, Solver, BruteForce};

let problem = SubsetSum::new(vec![3, 7, 1, 8, 2, 4], 11);
let solver = BruteForce::new();
let solution = solver.find_satisfying(&problem);
assert!(solution.is_some());

Implementations

impl SubsetSum

pub fn new(sizes: Vec<i64>, target: i64) -> Self

Create a new SubsetSum instance.

pub fn sizes(&self) -> &[i64]

Returns the element sizes.

pub fn target(&self) -> i64

Returns the target sum.

pub fn num_elements(&self) -> usize

Returns the number of elements.

Trait Implementations

impl Clone for SubsetSum

fn clone(&self) -> SubsetSum

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SubsetSum

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SubsetSum

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for SubsetSum

const NAME: &'static str = "SubsetSum"

Base name of this problem type (e.g., “MaximumIndependentSet”).

type Metric = bool

The evaluation metric type.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

fn dims(&self) -> Vec<usize>

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> bool

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

impl ReduceTo<SubsetSum> for KSatisfiability<K3>

type Result = Reduction3SATToSubsetSum

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl Serialize for SubsetSum

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for SubsetSum

impl SatisfactionProblem for SubsetSum