forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
knapsack_01.html
209 lines (174 loc) · 5.52 KB
/
knapsack_01.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
<html>
<head>
<title>
KNAPSACK_01 - Maximal Packing of a Knapsack with Given Items
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055" >
<h1 align = "center">
KNAPSACK_01 <br> Maximal Packing of a Knapsack with Given Items
</h1>
<hr>
<p>
<b>KNAPSACK_01</b>,
a C++ library which
uses brute force to solve small versions of the 0/1 knapsack problem.
</p>
<p>
In the 0/1 knapsack problem, we are given a knapsack with carrying
capacity C, and a set of N items, with the I-th item having a weight
of W(I). We want to pack as much total weight as possible into the
knapsack without exceeding the weight limit. We do this by specifying
with items we will not take (0) or take (1).
</p>
<p>
This library uses a simple brute force or exhaustive search method,
which is guaranteed to get the optimal solution, but which is not
efficient for large values of N.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>KNAPSACK_01</b> is available in
<a href = "../../c_src/knapsack_01/knapsack_01.html">a C version</a> and
<a href = "../../cpp_src/knapsack_01/knapsack_01.html">a C++ version</a> and
<a href = "../../f_src/knapsack_01/knapsack_01.html">a FORTRAN90 version</a> and
<a href = "../../f77_src/knapsack_01/knapsack_01.html">a FORTRAN77 version</a> and
<a href = "../../m_src/knapsack_01/knapsack_01.html">a MATLAB version.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/change_making/change_making.html">
CHANGE_MAKING</a>,
a C++ library which
considers the change making problem,
in which a given sum is to be formed using coins of various denominations.
</p>
<p>
<a href = "../../cpp_src/combination_lock/combination_lock.html">
COMBINATION_LOCK</a>,
a C++ program which
simulates the process of determining the secret combination of a lock.
</p>
<p>
<a href = "../../cpp_src/combo/combo.html">
COMBO</a>,
a C++ library which
includes many combinatorial routines.
</p>
<p>
<a href = "../../datasets/knapsack_01/knapsack_01.html">
KNAPSACK_01</a>,
a dataset directory which
contains test data for the 0/1 knapsack problem;
</p>
<p>
<a href = "../../cpp_src/partition_problem/partition_problem.html">
PARTITION_PROBLEM</a>,
a C++ library which
seeks solutions of the partition problem, splitting a set of integers into
two subsets with equal sum.
</p>
<p>
<a href = "../../cpp_src/satisfy/satisfy.html">
SATISFY</a>,
a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfiability problem.
</p>
<p>
<a href = "../../cpp_src/subset/subset.html">
SUBSET</a>,
a C++ library which
enumerates, generates, ranks and unranks combinatorial objects
including combinations, partitions, subsets, index sets, and trees.
</p>
<p>
<a href = "../../cpp_src/subset_sum/subset_sum.html">
SUBSET_SUM</a>,
a C++ library which
seeks solutions of the subset sum problem, in which it is desired
to find a subset of a set of integers which has a given sum.
</p>
<p>
<a href = "../../cpp_src/tsp_brute/tsp_brute.html">
TSP_BRUTE</a>,
a C++ program which
reads a file of city-to-city distances and solves the
traveling salesperson problem, using brute force.
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "knapsack_01.cpp">knapsack_01.cpp</a>, the source code.
</li>
<li>
<a href = "knapsack_01.hpp">knapsack_01.hpp</a>, the include file.
</li>
<li>
<a href = "knapsack_01.sh">knapsack_01.sh</a>,
BASH commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "knapsack_01_prb.cpp">knapsack_01_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "knapsack_01_prb.sh">knapsack_01_prb.sh</a>,
BASH commands to compile and run the sample program.
</li>
<li>
<a href = "knapsack_01_prb_output.txt">knapsack_01_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>KNAPSACK_01</b> seeks a solution of the 0/1 Knapsack problem.
</li>
<li>
<b>SUBSET_GRAY_NEXT</b> generates all subsets of a set of order N, one at a time.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 23 August 2014.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>