Phase Transitions in Combinatorial Optimization Problems
From MaRDI portal
Publication:5463601
DOI10.1002/3527606734zbMath1094.82002OpenAlexW1562473198WikidataQ58001578 ScholiaQ58001578MaRDI QIDQ5463601
Martin Weigt, Alexander K. Hartmann
Publication date: 4 August 2005
Full work available at URL: https://doi.org/10.1002/3527606734
Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02) Equilibrium statistical mechanics (82B99) Coloring of graphs and hypergraphs (05C15)
Related Items (25)
Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Network meta-analysis: a statistical physics perspective ⋮ Maximum independent sets on random regular graphs ⋮ Percolation on interdependent networks with a fraction of antagonistic interactions ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Generalized K-Core Percolation in Networks with Community Structure ⋮ Leveraging cluster backbones for improving MAP inference in statistical relational models ⋮ Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results ⋮ NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL ⋮ Two faces of greedy leaf removal procedure on graphs ⋮ On the critical exponent α of the 5D random-field Ising model ⋮ Research on solution space of bipartite graph vertex-cover by maximum matchings ⋮ Constructing concrete hard instances of the maximum independent set problem ⋮ A review of message passing algorithms in estimation of distribution algorithms ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods ⋮ Glassy behavior and jamming of a random walk process for sequentially satisfying a constraint satisfaction formula ⋮ CRITICALITY AND HETEROGENEITY IN THE SOLUTION SPACE OF RANDOM CONSTRAINT SATISFACTION PROBLEMS ⋮ Mathematical foundation of quantum annealing ⋮ Propagation of external regulation and asynchronous dynamics in random Boolean networks ⋮ From decidability to undecidability by considering regular sets of instances ⋮ The number of matchings in random graphs ⋮ Statistical mechanics and stability of a model eco-system ⋮ Geometric properties of satisfying assignments of random ε-1-in-kSAT ⋮ Replica theory for Levy spin glasses
Uses Software
This page was built for publication: Phase Transitions in Combinatorial Optimization Problems
