Phase Transitions in Combinatorial Optimization Problems
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02) Equilibrium statistical mechanics (82B99) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)
Recommendations
- Statistical mechanics methods and phase transitions in optimization problems
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Statistical mechanics: a general approach to combinatorial optimization
- Phase transitions in parameter rich optimization problems
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Refining the phase transition in combinatorial search
- Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- Publication:4488030
Cited in
(44)- Dual mean field search for large scale linear and quadratic knapsack problems
- Notes on computational-to-statistical gaps: predictions using statistical physics
- Measuring instance difficulty for combinatorial optimization problems
- Critical phenomena in a collective computation algorithm for combinatorial optimization problems
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- A review of message passing algorithms in estimation of distribution algorithms
- From decidability to undecidability by considering regular sets of instances
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Maximum independent sets on random regular graphs
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Free energy rates for a class of very noisy optimization problems
- Computational complexity, phase transitions, and message-passing for community detection
- scientific article; zbMATH DE number 4133843 (Why is no real title available?)
- Criticality and heterogeneity in the solution space of random constraint satisfaction problems
- Research on solution space of bipartite graph vertex-cover by maximum matchings
- Random multi-overlap structures for optimization problems
- Statistical physics and network optimization problems
- Cost distributions in large combinatorial optimisation problems
- NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL
- Information, Physics, and Computation
- Mathematical foundation of quantum annealing
- Propagation of external regulation and asynchronous dynamics in random Boolean networks
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Percolation on interdependent networks with a fraction of antagonistic interactions
- Exploring the role of graph spectra in graph coloring algorithm performance
- scientific article; zbMATH DE number 1735139 (Why is no real title available?)
- Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results
- Using cellular automata on a graph to model the exchanges of cash and goods
- Network meta-analysis: a statistical physics perspective
- Generalized \(K\)-core percolation in networks with community structure
- Two faces of greedy leaf removal procedure on graphs
- On the critical exponent of the 5D random-field Ising model
- Constructing concrete hard instances of the maximum independent set problem
- Phase transitions in parameter rich optimization problems
- The number of matchings in random graphs
- Statistical mechanics and stability of a model eco-system
- Phase transitions in machine learning.
- Scaling and universality in continuous length combinatorial optimization
- scientific article; zbMATH DE number 2243360 (Why is no real title available?)
- Geometric properties of satisfying assignments of random ε-1-in-kSAT
- Replica theory for Levy spin glasses
- Statistical mechanics methods and phase transitions in optimization problems
- Multi-hop generalized core percolation on complex networks
- Glassy behavior and jamming of a random walk process for sequentially satisfying a constraint satisfaction formula
This page was built for publication: Phase Transitions in Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463601)
