Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
From MaRDI portal
Publication:709664
DOI10.1016/j.cpc.2004.10.003zbMath1196.90107MaRDI QIDQ709664
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2004.10.003
combinatorial optimization; Monte Carlo simulation; knapsack problem; statistical mechanics; grand canonical ensemble
Uses Software
Cites Work
- A complete anytime algorithm for number partitioning
- Note on two theorems in nonequilibrium statistical mechanics
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Equation of State Calculations by Fast Computing Machines
- Determining computational complexity from characteristic ‘phase transitions’
- Statistical mechanics methods and phase transitions in optimization problems
- A physicist's approach to number partitioning
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item