Knapsack.h File Reference

Header file for the struct template BasicKnapsack, a 0-1 knapsack problem that implements the BranchAndBound concept [see BranchAndBound.h] with values of a given type, and Knapsack, the one with values of type double, with the random instances of the classes of Pisinger and the dynamic program that gives their optimal value; the tests and the benchmark of the Branch-and-Bound share it. More...

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <cmath>
#include <cstring>
#include <limits>
#include <random>
#include <type_traits>
#include <utility>
#include <vector>
#include "PBeFS/bnb/BranchAndBound.h"

Go to the source code of this file.

Classes
struct	BasicKnapsack< V >
	a 0-1 knapsack, its items sorted by decreasing ratio of profit to weight More...
struct	BasicKnapsack< V >::node_type

Namespaces
namespace	PBeFS_di_unipi_it
	namespace for the Parallel Best-First Search library

Typedefs
using	Knapsack = BasicKnapsack<>
	the 0-1 knapsack with values of type double

Detailed Description

Header file for the struct template BasicKnapsack, a 0-1 knapsack problem that implements the BranchAndBound concept [see BranchAndBound.h] with values of a given type, and Knapsack, the one with values of type double, with the random instances of the classes of Pisinger and the dynamic program that gives their optimal value; the tests and the benchmark of the Branch-and-Bound share it.

Author

Donato Meoli
Dipartimento di Informatica
Università di Pisa

Copyright

© by Donato Meoli