Classes
class	KnapsackBruteForceSolver

struct	KnapsackItemWithEfficiency

class	Knapsack64ItemsSolver

class	KnapsackDynamicProgrammingSolver

class	KnapsackMIPSolver

Namespaces
	operations_research
	The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.

Functions
bool	CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder (const KnapsackItemWithEfficiency &item1, const KnapsackItemWithEfficiency &item2)

Variable Documentation

◆ profit_max

const int64 profit_max

Definition at line 44 of file knapsack_solver.cc.