This is a Java Program to Implement Knapsack Algorithm. This algorithm is used to solve knapsack problem : Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
Here is the source code of the Java Program to Implement Knapsack Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** ** Java Program to Implement Knapsack Algorithm **/ import java.util.Scanner; /** Class Knapsack **/ public class Knapsack { public void solve(int[] wt, int[] val, int W, int N) { int NEGATIVE_INFINITY = Integer.MIN_VALUE; int[][] m = new int[N + 1][W + 1]; int[][] sol = new int[N + 1][W + 1]; for (int i = 1; i <= N; i++) { for (int j = 0; j <= W; j++) { int m1 = m[i - 1][j]; int m2 = NEGATIVE_INFINITY; if (j >= wt[i]) m2 = m[i - 1][j - wt[i]] + val[i]; /** select max of m1, m2 **/ m[i][j] = Math.max(m1, m2); sol[i][j] = m2 > m1 ? 1 : 0; } } /** make list of what all items to finally select **/ int[] selected = new int[N + 1]; for (int n = N, w = W; n > 0; n--) { if (sol[n][w] != 0) { selected[n] = 1; w = w - wt[n]; } else selected[n] = 0; } /** Print finally selected items **/ System.out.println("\nItems selected : "); for (int i = 1; i < N + 1; i++) if (selected[i] == 1) System.out.print(i +" "); System.out.println(); } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Knapsack Algorithm Test\n"); /** Make an object of Knapsack class **/ Knapsack ks = new Knapsack(); System.out.println("Enter number of elements "); int n = scan.nextInt(); int[] wt = new int[n + 1]; int[] val = new int[n + 1]; System.out.println("\nEnter weight for "+ n +" elements"); for (int i = 1; i <= n; i++) wt[i] = scan.nextInt(); System.out.println("\nEnter value for "+ n +" elements"); for (int i = 1; i <= n; i++) val[i] = scan.nextInt(); System.out.println("\nEnter knapsack weight "); int W = scan.nextInt(); ks.solve(wt, val, W, n); } }
Output:
Knapsack Algorithm Test Enter number of elements 5 Enter weight for 5 elements 50 10 20 40 30 Enter value for 5 elements 300 60 90 100 240 Enter knapsack weight 60 Items selected : 2 3 5
Related posts:
Java Program to Implement AA Tree
Date Time trong Java 8
Java Program to Implement LinkedBlockingDeque API
Java Program to Implement Bloom Filter
Java Program to Perform Naive String Matching
Java Program to Solve a Matching Problem for a Given Specific Case
Exception Handling in Java
Converting Between a List and a Set in Java
Java Program to Implement Pollard Rho Algorithm
Documenting a Spring REST API Using OpenAPI 3.0
Java Program to Check whether Graph is Biconnected
Spring RestTemplate Error Handling
Java Program to Implement Range Tree
Java Program to Implement an Algorithm to Find the Global min Cut in a Graph
A Quick Guide to Spring MVC Matrix Variables
HttpClient Basic Authentication
Java Program to Perform Preorder Non-Recursive Traversal of a Given Binary Tree
Java InputStream to Byte Array and ByteBuffer
Java Program to Check the Connectivity of Graph Using BFS
Java Program to Implement the Hill Cypher
Call Methods at Runtime Using Java Reflection
Java Program to Check whether Undirected Graph is Connected using BFS
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Setting the Java Version in Maven
Quick Guide to the Java StringTokenizer
Using Spring ResponseEntity to Manipulate the HTTP Response
Validations for Enum Types
How to Use if/else Logic in Java 8 Streams
Marker Interface trong Java
Sorting Query Results with Spring Data
Java Program to Find Basis and Dimension of a Matrix
Java Program to Perform Right Rotation on a Binary Search Tree