operations_research Namespace Reference

Classes
class	BaseKnapsackSolver
class	DenseDoublyLinkedList
class	DynamicPartition
class	DynamicPermutation
class	GraphSymmetryFinder
struct	KnapsackAssignment
class	KnapsackCapacityPropagator
class	KnapsackGenericSolver
struct	KnapsackItem
class	KnapsackPropagator
class	KnapsackSearchNode
class	KnapsackSearchPath
class	KnapsackSolver
	This library solves knapsack problems. More...
class	KnapsackState
class	MergingPartition

Typedefs
typedef KnapsackItem *	KnapsackItemPtr

Functions
void	MinimizeLinearAssignment (const std::vector< std::vector< double > > &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)
void	MaximizeLinearAssignment (const std::vector< std::vector< double > > &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)

Typedef Documentation

KnapsackItemPtr

typedef KnapsackItem* KnapsackItemPtr

Definition at line 324 of file knapsack_solver.h.

Function Documentation

MaximizeLinearAssignment()

void operations_research::MaximizeLinearAssignment	(	const std::vector< std::vector< double > > &	cost,
		absl::flat_hash_map< int, int > *	direct_assignment,
		absl::flat_hash_map< int, int > *	reverse_assignment
	)

MinimizeLinearAssignment()

void operations_research::MinimizeLinearAssignment	(	const std::vector< std::vector< double > > &	cost,
		absl::flat_hash_map< int, int > *	direct_assignment,
		absl::flat_hash_map< int, int > *	reverse_assignment
	)