bnb/Knapsack.h
Header of the layer bnb, in the group Problems; the same header on the site of Doxygen, its source on GitHub.
Classes
Class |
Description |
|---|---|
A 0-1 knapsack, its items sorted by decreasing ratio of profit to weight |
Types
-
using PBeFS_di_unipi_it::Knapsack = BasicKnapsack<>
the 0-1 knapsack with values of type double
Description of the header
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