Statistical mechanics analysis of generalized multi-dimensional knapsack problems
From MaRDI portal
Recommendations
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A hybrid algorithm for the unbounded knapsack problem
- A typology of cutting and packing problems
- Computational Complexity
- Computational aspects of hard knapsack problems.
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Discrete dynamic programming and capital allocation
- Expectation consistent approximate inference
- Greedy algorithm for the general multidimensional knapsack problem
- Information, Physics, and Computation
- Optimization of mean-field spin glasses
- Ottimizzazione Combinatoria
- Replica symmetry instability in perceptron models
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Statistical mechanics of the knapsack problem
- Statistical mechanics of the multi-constraint continuous knapsack problem
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Where are the hard knapsack problems?
Cited in
(3)
This page was built for publication: Statistical mechanics analysis of generalized multi-dimensional knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870449)