knapsack_solver.cc File Reference

#include "ortools/algorithms/knapsack_solver.h"
#include <algorithm>
#include <cstdint>
#include <limits>
#include <memory>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#include "absl/log/check.h"
#include "absl/strings/string_view.h"
#include "absl/time/time.h"
#include "ortools/base/stl_util.h"
#include "ortools/linear_solver/linear_solver.h"
#include "ortools/sat/cp_model.h"
#include "ortools/sat/cp_model.pb.h"
#include "ortools/sat/cp_model_solver.h"
#include "ortools/util/bitset.h"
#include "ortools/util/time_limit.h"

Go to the source code of this file.

Classes
class	operations_research::KnapsackBruteForceSolver
struct	operations_research::KnapsackItemWithEfficiency
class	operations_research::Knapsack64ItemsSolver
class	operations_research::KnapsackDynamicProgrammingSolver
class	operations_research::KnapsackDivideAndConquerSolver
class	operations_research::KnapsackMIPSolver
	--— KnapsackMIPSolver --— More...
class	operations_research::KnapsackCpSat
	--— KnapsackCpSat --— More...

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Functions
bool	operations_research::CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder (const KnapsackItemWithEfficiency &item1, const KnapsackItemWithEfficiency &item2)
	Comparator used to sort item in decreasing efficiency order.

Variable Documentation

profit_max

const int64_t profit_max

Definition at line 53 of file knapsack_solver.cc.