IDEAS home Printed from https://ideas.repec.org/r/spr/jcomop/v28y2014i1d10.1007_s10878-014-9734-0.html
   My bibliography  Save this item

The unconstrained binary quadratic programming problem: a survey

Citations

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


Cited by:

  1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
  2. Ricardo N. Liang & Eduardo A. J. Anacleto & Cláudio N. Meneses, 2022. "Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems," Journal of Heuristics, Springer, vol. 28(4), pages 433-479, August.
  3. Yitian Qian & Shaohua Pan & Shujun Bi, 2023. "A matrix nonconvex relaxation approach to unconstrained binary polynomial programs," Computational Optimization and Applications, Springer, vol. 84(3), pages 875-919, April.
  4. Kevin Wils & Boyang Chen, 2023. "A Symbolic Approach to Discrete Structural Optimization Using Quantum Annealing," Mathematics, MDPI, vol. 11(16), pages 1-29, August.
  5. Fred Glover & Gary Kochenberger & Yu Du, 2019. "Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models," 4OR, Springer, vol. 17(4), pages 335-371, December.
  6. Byron Tasseff & Tameem Albash & Zachary Morrell & Marc Vuffray & Andrey Y. Lokhov & Sidhant Misra & Carleton Coffrin, 2024. "On the emerging potential of quantum annealing hardware for combinatorial optimization," Journal of Heuristics, Springer, vol. 30(5), pages 325-358, December.
  7. 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.
  8. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
  9. Juntao Wang & Daniel Ebler & K. Y. Michael Wong & David Shui Wing Hui & Jie Sun, 2023. "Bifurcation behaviors shape how continuous physical dynamics solves discrete Ising optimization," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
  10. Aritra Sarkar & Zaid Al-Ars & Koen Bertels, 2021. "QuASeR: Quantum Accelerated de novo DNA sequence reconstruction," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-23, April.
  11. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
  12. Dylan Herman & Cody Googin & Xiaoyuan Liu & Alexey Galda & Ilya Safro & Yue Sun & Marco Pistoia & Yuri Alexeev, 2022. "A Survey of Quantum Computing for Finance," Papers 2201.02773, arXiv.org, revised Jun 2022.
  13. Martin Vesely, 2023. "Finding the Optimal Currency Composition of Foreign Exchange Reserves with a Quantum Computer," Papers 2303.01909, arXiv.org.
  14. Ajagekar, Akshay & You, Fengqi, 2022. "Quantum computing and quantum artificial intelligence for renewable and sustainable energy: A emerging prospect towards climate neutrality," Renewable and Sustainable Energy Reviews, Elsevier, vol. 165(C).
  15. Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
  16. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
  17. Leonardo Lozano & David Bergman & J. Cole Smith, 2020. "On the Consistent Path Problem," Operations Research, INFORMS, vol. 68(6), pages 1913-1931, November.
  18. David Bergman & Leonardo Lozano, 2021. "Decision Diagram Decomposition for Quadratically Constrained Binary Optimization," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 401-418, January.
  19. Teruyoshi Kobayashi & Tomokatsu Onaga, 2023. "Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(1), pages 251-287, July.
  20. Singh, Nongmeikapam Brajabidhu & Roy, Arnab & Saha, Anish Kumar, 2024. "Max-flow min-cut theorem in quantum computing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 649(C).
  21. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
  22. Mahdis Bayani & Borzou Rostami & Yossiri Adulyasak & Louis-Martin Rousseau, 2024. "A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1501-1521, December.
  23. 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.
  24. 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.
  25. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
  26. Aufenanger, Tobias, 2018. "Treatment allocation for linear models," FAU Discussion Papers in Economics 14/2017, Friedrich-Alexander University Erlangen-Nuremberg, Institute for Economics, revised 2018.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.