Lecture
Knapsack Problem: Optimization and Traveling Salesman
Description
This lecture covers the knapsack problem in discrete optimization, where given a list of objects with weights and a maximum capacity, the goal is to maximize the value of the objects in the knapsack. It also delves into the traveling salesman problem, aiming to find the shortest closed path passing through all cities exactly once. Various algorithms are discussed, including brute-force, nearest neighbor, and permutation-based approaches, with a focus on polynomial time complexity and approximation guarantees.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.