Can someone solve the CONSTRAINT using JAVA. Cutting rod
problem
Constraints: Lengths with even numbers can be included multiple times, but lengths with odd numbers can be included only one time. So, for the same example, the maximum obtainable value is by taking lengths 6 and 2 since length #1 cannot be included more than once. Length i 1 2 3 4 5 6 7 8 Price pi 3 5 8 9 10 17 18 20
Can someone solve the CONSTRAINT using JAVA. Cutting rod problem
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am