Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
DOI10.1016/J.CPC.2004.10.003zbMATH Open1196.90107OpenAlexW2014970962MaRDI QIDQ709664FDOQ709664
Authors: Karl-Heinz Zimmermann 
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
Recommendations
- Monte Carlo solution of combinatorial optimization problems
- Statistical mechanics of the knapsack problem
- Statistical mechanics: a general approach to combinatorial optimization
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Using stratified sampling to solve the Knapsack problem
combinatorial optimizationMonte Carlo simulationknapsack problemstatistical mechanicsgrand canonical ensemble
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Title not available (Why is that?)
- A complete anytime algorithm for number partitioning
- Determining computational complexity from characteristic ``phase transitions
- Statistical mechanics methods and phase transitions in optimization problems
- Note on two theorems in nonequilibrium statistical mechanics
- A physicist's approach to number partitioning
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709664)
