Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::BasicKnapsackSolver::Result Struct Reference

Detailed Description

Solves the problem:

  • minimize sum costs * X[i]
  • subject to sum coeffs[i] * X[i] \in rhs, with X[i] \in Domain(i).

Returns:

  • (solved = false) if complexity is too high.
  • (solved = true, infeasible = true) if proven infeasible.
  • (solved = true, infeasible = false, solution) otherwise.

Definition at line 578 of file util.h.

#include <util.h>

Public Attributes

bool solved = false
bool infeasible = false
std::vector< int64_t > solution

Member Data Documentation

◆ infeasible

bool operations_research::sat::BasicKnapsackSolver::Result::infeasible = false

Definition at line 580 of file util.h.

◆ solution

std::vector<int64_t> operations_research::sat::BasicKnapsackSolver::Result::solution

Definition at line 581 of file util.h.

◆ solved

bool operations_research::sat::BasicKnapsackSolver::Result::solved = false

Definition at line 579 of file util.h.

The documentation for this struct was generated from the following file: