The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Abstract
We study the problem of finding ground states of spin glasses with exterior magnetic field, and the problem of minimizing the number of vias (holes on a printed circuit board, or contacts on a chip) subject to pin preassignments and layer preferences. The former problem comes up in solid-state physics, and the latter in very-large-scale-integrated (VLSI) circuit design and in printed circuit board design. Both problems can be reduced to the max-cut problem in graphs. Based on a partial characterization of the cut polytope, we design a cutting plane algorithm and report on computational experience with it. Our method has been used to solve max-cut problems on graphs with up to 1,600 nodes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Self-citationMatching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
Finding a Maximum Cut of a Planar Graph in Polynomial Time
Hadlock, F. (1975) · SIAM Journal on Computing · doi:10.1137/0204019 · Cited by 389
Barahona, F., & Mahjoub, A. R. (1986) · Mathematical Programming · doi:10.1007/bf02592023 · Cited by 374
Self-citationMagnetic correlations in two-dimensional spin-glasses
Morgenstern, I., & Binder, K. (1980) · Physical Review B · doi:10.1103/physrevb.22.288 · Cited by 304
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
Theory of the frustration effect in spin glasses: I
Toulouse, G. (1986) · World Scientific lecture notes in physics · doi:10.1142/9789812799371_0009 · Cited by 196
On the ground states of the frustration model of a spin glass by a matching method of graph theory
Bieche, L., Uhry, J. P., Maynard, R., & Rammal, R. (1980) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/13/8/005 · Cited by 169
Solving matching problems with linear programming
Grötschel, M., & Holland, O. E. (1985) · Mathematical Programming · doi:10.1007/bf01584376 · Cited by 88
Self-citation
Cited by
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
“In several practical problems, some edge weights are negative [4].”
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
“Pseudo-Boolean functions appearing in polynomial (or other algebraic) representation play a major role in optimization models in a variety of areas, including VLSI design (via minimization [17, 34]), statistical mechanics (spin glasses [17, 50]), reliability theory (fault location [137]), computer science (maximum sat…”
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Hoffman, K. L., & Padberg, M. (1993) · Management Science · doi:10.1287/mnsc.39.6.657 · Cited by 537
The unconstrained binary quadratic programming problem: a survey
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9734-0 · Cited by 473
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Goto, H., Tatsumura, K., & Dixon, A. R. (2019) · Science Advances · doi:10.1126/sciadv.aav2372 · Cited by 405
A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing
(2016) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2015.2498601 · Cited by 368
Round robin scheduling – a survey
Rasmussen, R. V., & Trick, M. A. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.05.046 · Cited by 343
Energy Minimization via Graph Cuts: Settling What is Possible
Freedman, D., & Drineas, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.143 · Cited by 173
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Dunning, I., Gupta, S., & Silberholz, J. (2018) · INFORMS Journal on Computing · doi:10.1287/ijoc.2017.0798 · Cited by 128
“…due to their broad practical applicability: Max-Cut applications include VLSI design, network design, statistical physics, and image segmentation (Barahona et al. 1988, Barahona 1996, de Sousa et al. 2013), and QUBO applications include capital budgeting and financial analysis, computer aided…”
BackgroundOptimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62
Metadata
- Authors
- Barahona, F., Grötschel, M., Jünger, M., & Reinelt, G.
- Venue
- Operations Research
- Published
- 1988-06
- Volume
- 36
- Issue
- 3
- Pages
- 493-513
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2159739530
- Cited by
- 504
- References
- 15
- FWCI
- 5.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.