scientific article; zbMATH DE number 1163496
algorithmsbranch-and-cut algorithmscombinatorial optimization methodsfrustrated, disordered systemsground state calculationsmaximum-flow algorithmsminimum-cost-flow algorithmsMonte Carlo methodrandom bond Ising ferromagnetrandom field Ising modelshortest path algorithmsolid-on-solid modelspin glass problemtraffic flow networks
Monte Carlo methods (65C05) Numerical mathematical programming methods (65K05) Applications to the sciences (65Z05) Software, source code, etc. for problems pertaining to statistical mechanics (82-04) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
- The global minimum of energy is not always a sum of local minima -- A note on frustration
- Configuration space analysis for optimization problems
- scientific article; zbMATH DE number 1735139 (Why is no real title available?)
- scientific article; zbMATH DE number 2159018 (Why is no real title available?)
- scientific article; zbMATH DE number 2159020 (Why is no real title available?)
- Polynomial combinatorial optimization methods for analysing the ground states of disordered systems
- An algorithm for finding the first excited state in the random-field Ising model
- Statistical mechanics methods and phase transitions in optimization problems
- A physicist's approach to number partitioning
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395050)
