operations_research::KnapsackSearchNode Class Reference

Detailed Description

KnapsackSearchNode is a class used to describe a decision in the decision search tree.

The node is defined by a pointer to the parent search node and an assignment (see KnapsackAssignement). As the current state is not explicitly stored in a search node, one should go through the search tree to incrementally build a partial solution from a previous search node.

Definition at line 318 of file knapsack_solver.h.

#include <knapsack_solver.h>

Public Member Functions
	KnapsackSearchNode (const KnapsackSearchNode *parent, const KnapsackAssignment &assignment)
	KnapsackSearchNode (const KnapsackSearchNode &)=delete
KnapsackSearchNode &	operator= (const KnapsackSearchNode &)=delete
int	depth () const
const KnapsackSearchNode *	parent () const
const KnapsackAssignment &	assignment () const
int64_t	current_profit () const
void	set_current_profit (int64_t profit)
int64_t	profit_upper_bound () const
void	set_profit_upper_bound (int64_t profit)
int	next_item_id () const
void	set_next_item_id (int id)

Constructor & Destructor Documentation

KnapsackSearchNode() [1/2]

operations_research::KnapsackSearchNode::KnapsackSearchNode	(	const KnapsackSearchNode *	parent,
		const KnapsackAssignment &	assignment )

Definition at line 111 of file knapsack_solver.cc.

KnapsackSearchNode() [2/2]

operations_research::KnapsackSearchNode::KnapsackSearchNode ( const KnapsackSearchNode & )

delete

Member Function Documentation

assignment()

const KnapsackAssignment & operations_research::KnapsackSearchNode::assignment ( ) const

inline

Definition at line 331 of file knapsack_solver.h.

current_profit()

int64_t operations_research::KnapsackSearchNode::current_profit ( ) const

inline

Definition at line 333 of file knapsack_solver.h.

depth()

int operations_research::KnapsackSearchNode::depth ( ) const

inline

Definition at line 329 of file knapsack_solver.h.

next_item_id()

int operations_research::KnapsackSearchNode::next_item_id ( ) const

inline

Definition at line 339 of file knapsack_solver.h.

operator=()

KnapsackSearchNode & operations_research::KnapsackSearchNode::operator= ( const KnapsackSearchNode & )

delete

parent()

const KnapsackSearchNode * operations_research::KnapsackSearchNode::parent ( ) const

inline

Definition at line 330 of file knapsack_solver.h.

profit_upper_bound()

int64_t operations_research::KnapsackSearchNode::profit_upper_bound ( ) const

inline

Definition at line 336 of file knapsack_solver.h.

set_current_profit()

void operations_research::KnapsackSearchNode::set_current_profit ( int64_t profit )

inline

Definition at line 334 of file knapsack_solver.h.

set_next_item_id()

void operations_research::KnapsackSearchNode::set_next_item_id ( int id )

inline

Definition at line 340 of file knapsack_solver.h.

set_profit_upper_bound()

void operations_research::KnapsackSearchNode::set_profit_upper_bound ( int64_t profit )

inline

Definition at line 337 of file knapsack_solver.h.

---

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

• ortools/algorithms/knapsack_solver.h
• ortools/algorithms/knapsack_solver.cc