Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension

DOI10.1088/1742-5468/AAD3F7zbMath1456.05164arXiv1805.07178OpenAlexW2804510743WikidataQ129408913 ScholiaQ129408913MaRDI QIDQ3303328

Andrea di Gioacchino, Enrico M. Malatesta, Sergio Caracciolo

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.07178

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorial optimization (90C27)

Related Items (2)

Average optimal cost for the Euclidean TSP in one dimension ⋮ Anomalous scaling of the optimal cost in the one-dimensional random assignment problem

Cites Work

• Optimization by Simulated Annealing
• The TSP phase transition
• A PDE approach to a 2-dimensional matching problem
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Information, Physics, and Computation
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Determining computational complexity from characteristic ‘phase transitions’
• Statistical mechanics methods and phase transitions in optimization problems
• Unnamed Item

This page was built for publication: Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension