IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v36y1988i3p493-513.html
   My bibliography  Save this item

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
  2. Arman Boyacı & Tınaz Ekim & Mordechai Shalom, 2018. "The maximum cardinality cut problem in co-bipartite chain graphs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 250-265, January.
  3. Xunzhao Yin & Yu Qian & Alptekin Vardar & Marcel Günther & Franz Müller & Nellie Laleni & Zijian Zhao & Zhouhang Jiang & Zhiguo Shi & Yiyu Shi & Xiao Gong & Cheng Zhuo & Thomas Kämpfe & Kai Ni, 2024. "Ferroelectric compute-in-memory annealer for combinatorial optimization problems," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
  4. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
  5. Cheng Lu & Zhibin Deng, 2021. "A branch-and-bound algorithm for solving max-k-cut problem," Journal of Global Optimization, Springer, vol. 81(2), pages 367-389, October.
  6. Geng Lin & Wenxing Zhu, 2012. "A discrete dynamic convexized method for the max-cut problem," Annals of Operations Research, Springer, vol. 196(1), pages 371-390, July.
  7. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
  8. Sinjorgo, Lennart & Sotirov, Renata & Anjos, M.F., 2024. "Cuts and semidefinite liftings for the complex cut polytope," Other publications TiSEM e99ba505-f4f2-4b3c-a6b5-2, Tilburg University, School of Economics and Management.
  9. Chuangchuang Sun, 2023. "A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming," Mathematics, MDPI, vol. 11(21), pages 1-27, October.
  10. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
  11. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
  12. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2019. "Improving the linear relaxation of maximum k-cut with semidefinite-based constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 123-151, June.
  13. Goldengorin, Boris & Sierksma, Gerard & Tijssen, Gert A., 1998. "The data-correcting algorithm for supermodular functions, with applications to quadratic cost partition and simple plant location problems," Research Report 98A08, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  14. Pierre Fouilhoux & A. Mahjoub, 2012. "Solving VLSI design and DNA sequencing problems using bipartization of graphs," Computational Optimization and Applications, Springer, vol. 51(2), pages 749-781, March.
  15. Yang, Qingzhi & Li, Yiyong & Huang, Pengfei, 2020. "A novel formulation of the max-cut problem and related algorithm," Applied Mathematics and Computation, Elsevier, vol. 371(C).
  16. Fred Glover & Jin-Kao Hao, 2016. "f-Flip strategies for unconstrained binary quadratic programming," Annals of Operations Research, Springer, vol. 238(1), pages 651-657, March.
  17. Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
  18. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
  19. F. Liers & G. Pardella, 2012. "Partitioning planar graphs: a fast combinatorial approach for max-cut," Computational Optimization and Applications, Springer, vol. 51(1), pages 323-344, January.
  20. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  21. Iain Dunning & Swati Gupta & John Silberholz, 2018. "What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 608-624, August.
  22. repec:dgr:rugsom:98a08 is not listed on IDEAS
  23. Shenshen Gu & Yue Yang, 2020. "A Deep Learning Algorithm for the Max-Cut Problem Based on Pointer Network Structure with Supervised Learning and Reinforcement Learning Strategies," Mathematics, MDPI, vol. 8(2), pages 1-20, February.
  24. repec:dgr:rugsom:99a17 is not listed on IDEAS
  25. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.
  26. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2018. "Computational study of valid inequalities for the maximum k-cut problem," Annals of Operations Research, Springer, vol. 265(1), pages 5-27, June.
  27. Mark W. Lewis & Amit Verma & Todd T. Eckdahl, 2021. "Qfold: a new modeling paradigm for the RNA folding problem," Journal of Heuristics, Springer, vol. 27(4), pages 695-717, August.
  28. Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  29. Ling, Ai-Fan & Xu, Cheng-Xian & Xu, Feng-Min, 2009. "A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems," European Journal of Operational Research, Elsevier, vol. 197(2), pages 519-531, September.
  30. Brahim Chaourar, 2020. "Connected max cut is polynomial for graphs without the excluded minor $$K_5\backslash e$$ K 5 \ e," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 869-875, November.
  31. Miguel F. Anjos & Henry Wolkowicz, 2002. "Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 237-270, September.
  32. Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber, 2016. "Building an iterative heuristic solver for a quantum annealer," Computational Optimization and Applications, Springer, vol. 65(3), pages 845-869, December.
  33. Hongwei Liu & Sanyang Liu & Fengmin Xu, 2003. "A Tight Semidefinite Relaxation of the MAX CUT Problem," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 237-245, September.
  34. Fred Glover & Jin-Kao Hao, 2016. "f-Flip strategies for unconstrained binary quadratic programming," Annals of Operations Research, Springer, vol. 238(1), pages 651-657, March.
  35. Zhenbo Wang & Shu-Cherng Fang & David Gao & Wenxun Xing, 2012. "Canonical dual approach to solving the maximum cut problem," Journal of Global Optimization, Springer, vol. 54(2), pages 341-351, October.
  36. Chao Yun & Zhongyu Liang & Aleš Hrabec & Zhentao Liu & Mantao Huang & Leran Wang & Yifei Xiao & Yikun Fang & Wei Li & Wenyun Yang & Yanglong Hou & Jinbo Yang & Laura J. Heyderman & Pietro Gambardella , 2023. "Electrically programmable magnetic coupling in an Ising network exploiting solid-state ionic gating," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
  37. repec:dgr:rugsom:04a20 is not listed on IDEAS
  38. Ben-Ameur, Walid & Neto, José, 2010. "Spectral bounds for unconstrained (-1,1)-quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 207(1), pages 15-24, November.
  39. Wenxing Zhu & Geng Lin & M. M. Ali, 2013. "Max- k -Cut by the Discrete Dynamic Convexized Method," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 27-40, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.