operations_research::KnapsackBruteForceSolver Class Reference

KnapsackBruteForceSolver KnapsackBruteForceSolver solves the 0-1 knapsack problem when the number of items is less or equal to 30 with brute force, ie. More...

Inheritance diagram for operations_research::KnapsackBruteForceSolver:

List of all members.

Public Member Functions
	KnapsackBruteForceSolver (const string &solver_name)
void	Init (const std::vector< int64 > &profits, const std::vector< std::vector< int64 > > &weights, const std::vector< int64 > &capacities)
	Initializes the solver and enters the problem to be solved.
int64	Solve ()
	Solves the problem and returns the profit of the optimal solution.
bool	best_solution (int item_id) const
	Returns true if the item 'item_id' is packed in the optimal knapsack.

---

Detailed Description

KnapsackBruteForceSolver KnapsackBruteForceSolver solves the 0-1 knapsack problem when the number of items is less or equal to 30 with brute force, ie.

explores all states. Experiments show better results than KnapsackGenericSolver when the number of items is less than 15.

Definition at line 559 of file knapsack_solver.cc.

---

Constructor & Destructor Documentation

operations_research::KnapsackBruteForceSolver::KnapsackBruteForceSolver

(

const string &

solver_name

)

[explicit]

Definition at line 586 of file knapsack_solver.cc.

---

Member Function Documentation

void operations_research::KnapsackBruteForceSolver::Init	(	const std::vector< int64 > &	profits,
		const std::vector< std::vector< int64 > > &	weights,
		const std::vector< int64 > &	capacities
	)			[virtual]

Initializes the solver and enters the problem to be solved.

Implements operations_research::BaseKnapsackSolver.

Definition at line 594 of file knapsack_solver.cc.

int64 operations_research::KnapsackBruteForceSolver::Solve

(

)

[virtual]

Solves the problem and returns the profit of the optimal solution.

Implements operations_research::BaseKnapsackSolver.

Definition at line 616 of file knapsack_solver.cc.

bool operations_research::KnapsackBruteForceSolver::best_solution

(

int

item_id

)

const [inline, virtual]

Returns true if the item 'item_id' is packed in the optimal knapsack.

Implements operations_research::BaseKnapsackSolver.

Definition at line 572 of file knapsack_solver.cc.

---

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

• or-tools/src/algorithms/knapsack_solver.cc