Large N limit of the knapsack problem

06/22/2021
by   Mobolaji Williams, et al.
0

In the simplest formulation of the knapsack problem, one seeks to maximize the total value of a collection of objects such that the total weight remains below a certain limit. In this work, we move from computer science to physics and formulate the knapsack problem as a statistical physics system and compute the corresponding partition function. We approximate the result in the large number limit and from this approximation develop a new algorithm for the problem. We compare the performance of this algorithm to that of other approximation algorithms, finding that the new algorithm is faster than most of these approaches while still retaining high accuracy. From its speed and accuracy relationship, we argue that the algorithm is a manifestation of a greedy algorithm. We conclude by discussing ways to extend the formalism to make its underlying heuristics more rigorous or to apply the approach to other combinatorial optimization problems. In all, this work exists at the intersection between computer science and statistical physics and represents a new analytical approach to solving the problems in the former using methods of the latter.

READ FULL TEXT
research
01/30/2013

Statistical mechanics of complex neural systems and high dimensional data

Recent experimental advances in neuroscience have opened new vistas into...
research
04/14/2020

Gumbel-softmax-based Optimization: A Simple General Framework for Optimization Problems on Graphs

In computer science, there exist a large number of optimization problems...
research
03/29/2018

Notes on computational-to-statistical gaps: predictions using statistical physics

In these notes we describe heuristics to predict computational-to-statis...
research
05/25/2017

An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem

With applications to many disciplines, the traveling salesman problem (T...
research
11/08/2022

Fast Algorithms for ℓ_p-Regression

The ℓ_p-norm regression problem is a classic problem in optimization wit...
research
08/29/2022

Inference and Optimization for Engineering and Physical Systems

The central object of this PhD thesis is known under different names in ...
research
06/22/2020

Fast overlap detection between hard-core colloidal cuboids and spheres. The OCSI algorithm

Collision between rigid three-dimensional objects is a very common model...

Please sign up or login with your details

Forgot password? Click here to reset