In a jungle expedition supply chain, crates of food and equipment are transported to various camps using a network of rivers and trails. Each crate has a unique identifier and a specific weight, and the expedition leader needs to determine the most efficient way to transport these crates to minimize the total weight carried by each porter. The porters can only carry a maximum of 27 kilograms at a time, and the crates can be divided into smaller packages if necessary. The expedition leader has a list of crate identifiers and their corresponding weights, and needs to find the optimal way to assign these crates to the porters.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak