Application of statistical mechanics to NP-complete problems in combinatorial optimisation
From MaRDI portal
Publication:3744206
DOI10.1088/0305-4470/19/9/033zbMATH Open0606.05064OpenAlexW1965121855MaRDI QIDQ3744206FDOQ3744206
Authors: Yaotian Fu, Philip W. Anderson 
Publication date: 1986
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0305-4470/19/9/033
Recommendations
- Statistical mechanics methods and phase transitions in optimization problems
- Publication:3035151
- Phase Transition in the Number Partitioning Problem
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- Phase Transitions in Combinatorial Optimization Problems
Analysis of algorithms and problem complexity (68Q25) Classical equilibrium statistical mechanics (general) (82B05) Graph theory (05C99)
Cited In (45)
- Maximum independent sets on random regular graphs
- An accelerated procedure for solving binary optimization problems
- Graph clustering with Boltzmann machines
- The peculiar phase structure of random graph bisection
- Statistical mechanics methods and phase transitions in optimization problems
- Phase transitions of subset sum and Shannon's limit in source coding
- Increasing the attraction area of the global minimum in the binary optimization problem
- Analytic constant thermodynamic speed-cooling strategies in simulated annealing
- Fixed-point attractors in analog neural computation
- Typical performance of approximation algorithms for NP-hard problems
- Quantum Monte Carlo annealing with multi-spin dynamics
- Constructing concrete hard instances of the maximum independent set problem
- More about NP-completeness in the frustration model of spin-glasses
- A novel approach to Ising problems
- Finding maximum independent set based on multi-stage simulated quantum adiabatic evolution
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model
- Phase Transition in the Number Partitioning Problem
- The Shape of a Local Minimum and the Probability of its Detection in Random Search
- On independent sets in random graphs
- Graph bipartitioning and statistical mechanics
- The demon algorithm
- Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension
- On computational capabilities of Ising machines based on nonlinear oscillators
- The marginally stable Bethe lattice spin glass revisited
- Statistical mechanics of the maximum-average submatrix problem
- MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
- Statistical mechanics of an NP-complete problem: subset sum
- Landscapes and their correlation functions
- Neutrality in fitness landscapes.
- Combining simulated annealing with local search heuristics
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Average optimal cost for the Euclidean TSP in one dimension
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- Disordered systems insights on computational hardness
- Title not available (Why is that?)
- The random quadratic assignment problem
- When are networks truly modular?
- Application of the clipping procedure to the binary minimization of a quadratic functional
- Title not available (Why is that?)
- Phase Transitions in Combinatorial Optimization Problems
- q-partitioning of graphs with finite coordination number
- Bipartitioning of directed and mixed random graphs
- Random walks and orthogonal functions associated with highly symmetric graphs
- Title not available (Why is that?)
- Network bipartitioning in the anti-communicability Euclidean space
This page was built for publication: Application of statistical mechanics to NP-complete problems in combinatorial optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744206)
