{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T17:06:27Z","timestamp":1772643987985,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12532-025-00293-z","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T04:15:59Z","timestamp":1761624959000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetry Detection in Mixed-Integer Conic Programming"],"prefix":"10.1007","volume":"18","author":[{"given":"Sven","family":"Wiese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"key":"293_CR1","unstructured":"MINLPLib: A Library of Mixed-Integer and Continuous Nonlinear Programming Instances. https:\/\/www.minlplib.org\/. Accessed April-02-2024"},{"key":"293_CR2","unstructured":"The MOSEK Notebook Collection: Geometric facility location. https:\/\/nbviewer.org\/github\/MOSEK\/Tutorials\/blob\/master\/facility-location\/small_disks.ipynb. Accessed August-12-2022"},{"key":"293_CR3","unstructured":"The MOSEK Notebook Collection: Subcarrier and power allocation. https:\/\/nbviewer.org\/github\/MOSEK\/Tutorials\/blob\/master\/f-sparc\/fsparc.ipynb. Accessed August-12-2022"},{"issue":"2","key":"293_CR4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"293_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"293_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-1-4614-0769-0_9","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"C Bachoc","year":"2012","unstructured":"Bachoc, C., Gijswijt, D.C., Schrijver, A., Vallentin, F.: Invariant Semidefinite Programs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 219\u2013269. Springer, US, Boston, MA (2012)"},{"key":"293_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-019-01457-1","volume":"186","author":"P Bendotti","year":"2021","unstructured":"Bendotti, P., Fouilhoux, P., Rottner, C.: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem. Math. Programming 186, 337\u2013372 (2021)","journal-title":"Math. Programming"},{"key":"293_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-00142-0_70","volume-title":"Operations Research Proceedings 2008","author":"T Berthold","year":"2009","unstructured":"Berthold, T., Pfetsch, M.: Detecting Orbitopal Symmetries. In: Fleischmann, B., Borgwardt, K.H., Klein, R., Tuma, A. (eds.) Operations Research Proceedings 2008, pp. 433\u2013438. Springer, Berlin, Heidelberg (2009)"},{"key":"293_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10107-011-0487-6","volume":"137","author":"R B\u00f6di","year":"2013","unstructured":"B\u00f6di, R., Herr, K., Joswig, M.: Algorithms for highly symmetric linear and integer programs. Math. Program. 137, 65\u201390 (2013)","journal-title":"Math. Program."},{"key":"293_CR10","unstructured":"Christophel, P.M., G\u00fczelsoy, M., P\u00f3lik, I.: New symmetries in mixed-integer linear optimization: Symmetry heuristics and complement-based symmetries. Tech. rep. (2014). https:\/\/optimization-online.org\/wp-content\/uploads\/2014\/07\/4466.pdf. Accessed March-12-2024"},{"key":"293_CR11","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Proceedings of the 41st Annual Design Automation Conference, pp. 530\u2013534 (2004)","DOI":"10.1145\/996566.996712"},{"key":"293_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10107-024-02102-2","volume":"212","author":"J van Doornmalen","year":"2024","unstructured":"van Doornmalen, J., Hojny, C.: A unified framework for symmetry handling. Math. Programming 212, 217\u2013271 (2024)","journal-title":"Math. Programming"},{"issue":"36","key":"293_CR13","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1287\/ijoc.2022.0060","volume":"3","author":"J van Doornmalen","year":"2024","unstructured":"van Doornmalen, J., Hojny, C.: Efficient propagation techniques for handling cyclic symmetries in binary programs. INFORMS J. Comput. 3(36), 868\u2013883 (2024)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"293_CR14","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1090.0392","volume":"34","author":"Y Faenza","year":"2009","unstructured":"Faenza, Y., Kaibel, V.: Extended formulations for packing and partitioning orbitopes. Math. Oper. Res. 34(3), 686\u2013697 (2009)","journal-title":"Math. Oper. Res."},{"key":"293_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-32147-4_6","volume-title":"Combinatorial Optimization","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Liberti, L.: Orbital Shrinking. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) Combinatorial Optimization, pp. 48\u201358. Springer, Berlin Heidelberg (2012)"},{"key":"293_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s12532-015-0092-4","volume":"8","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization. Math. Program. Comput. 8, 191\u2013214 (2016)","journal-title":"Math. Program. Comput."},{"key":"293_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73556-4_17","volume-title":"Combinatorial Optimization and Applications","author":"EJ Friedman","year":"2007","unstructured":"Friedman, E.J.: Fundamental Domains for Integer Programs with Symmetries. In: Dress, A., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications, pp. 146\u2013153. Springer, Berlin Heidelberg (2007)"},{"key":"293_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2018","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N., Vigerske, S., Wiegele, A.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11, 237\u2013265 (2018)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"293_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"issue":"8","key":"293_CR20","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/0740817X.2010.541899","volume":"43","author":"A Ghoniem","year":"2011","unstructured":"Ghoniem, A., Sherali, H.D.: Defeating symmetry in combinatorial optimization via objective perturbations and hierarchical constraints. IIE Trans. 43(8), 575\u2013588 (2011)","journal-title":"IIE Trans."},{"key":"293_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-662-44777-2_42","volume-title":"Algorithms - ESA 2014","author":"M Grohe","year":"2014","unstructured":"Grohe, M., Kersting, K., Mladenov, M., Selman, E.: Dimension Reduction via Colour Refinement. In: Schulz, A.S., Wagner, D. (eds.) Algorithms - ESA 2014, pp. 505\u2013516. Springer, Berlin Heidelberg (2014)"},{"key":"293_CR22","unstructured":"Herr, K.: Core Sets and Symmetric Convex Optimization. Ph.D. thesis, TU Darmstadt (2013)"},{"issue":"3","key":"293_CR23","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.orl.2013.02.007","volume":"41","author":"K Herr","year":"2013","unstructured":"Herr, K., Rehn, T., Sch\u00fcrmann, A.: Exploiting symmetry in integer convex optimization using core points. Oper. Res. Lett. 41(3), 298\u2013304 (2013)","journal-title":"Oper. Res. Lett."},{"key":"293_CR24","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s00454-014-9638-x","volume":"53","author":"K Herr","year":"2015","unstructured":"Herr, K., Rehn, T., Sch\u00fcrmann, A.: On lattice-free orbit polytopes. Discrete & Computational Geometry 53, 144\u2013172 (2015)","journal-title":"Discrete & Computational Geometry"},{"key":"293_CR25","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.dam.2020.03.002","volume":"283","author":"C Hojny","year":"2020","unstructured":"Hojny, C.: Packing, partitioning, and covering symresacks. Discret. Appl. Math. 283, 689\u2013717 (2020)","journal-title":"Discret. Appl. Math."},{"key":"293_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10107-018-1239-7","volume":"175","author":"C Hojny","year":"2019","unstructured":"Hojny, C., Pfetsch, M.: Polytopes associated with symmetry handling. Math. Program. 175, 197\u2013240 (2019)","journal-title":"Math. Program."},{"key":"293_CR27","doi-asserted-by":"crossref","unstructured":"Hojny, C., Pfetsch, M.: Handling Symmetries in Mixed-Integer Semidefinite Programs. In: A.A. Cire (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2023, pp. 69\u201378. Springer (2023)","DOI":"10.1007\/978-3-031-33271-5_5"},{"key":"293_CR28","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: D.\u00a0Applegate, G.S. Brodal, D.\u00a0Panario, R.\u00a0Sedgewick (eds.) Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, pp. 135\u2013149. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"issue":"4","key":"293_CR29","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discret. Optim. 8(4), 595\u2013610 (2011)","journal-title":"Discret. Optim."},{"key":"293_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114, 1\u201336 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"293_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"293_CR32","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-020-01519-9","volume":"190","author":"AN Letchford","year":"2021","unstructured":"Letchford, A.N., Ni, Q., Zhong, Z.: Bi-perspective functions for mixed-integer fractional programs with indicator variables. Math. Program. 190, 39\u201355 (2021)","journal-title":"Math. Program."},{"key":"293_CR33","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-85097-7_31","volume-title":"Combinatorial Optimization and Applications","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Automatic Generation of Symmetry-Breaking Constraints. In: Yang, B., Du, D.Z., Wang, C.A. (eds.) Combinatorial Optimization and Applications, pp. 328\u2013338. Springer, Berlin Heidelberg (2008)"},{"key":"293_CR34","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131, 273\u2013304 (2012)","journal-title":"Math. Program."},{"key":"293_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-1927-3_9","volume-title":"Mixed Integer Nonlinear Programming","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Symmetry in mathematical programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 263\u2013283. Springer, New York (2012)"},{"key":"293_CR36","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Global Optim. 60, 183\u2013194 (2014)","journal-title":"J. Global Optim."},{"key":"293_CR37","doi-asserted-by":"crossref","unstructured":"M. Lubin and E. Yamangil and R. Bent and J. P. Vielma: Extended Formulations in Mixed-integer Convex Programming. In: Q.\u00a0Louveaux, M.\u00a0Skutella (eds.) Integer Programming and Combinatorial Optimization. IPCO 2016. Lecture Notes in Computer Science, Volume 9682, pp. 102\u2013113. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-33461-5_9"},{"key":"293_CR38","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94, 71\u201390 (2002)","journal-title":"Math. Program."},{"key":"293_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. 98, 3\u201321 (2003)","journal-title":"Math. Program."},{"key":"293_CR40","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F Margot","year":"2003","unstructured":"Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94, 207\u2013220 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"293_CR41","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2006.10.008","volume":"4","author":"F Margot","year":"2007","unstructured":"Margot, F.: Symmetric ILP: Coloring and small integers. Discret. Optim. 4(1), 40\u201362 (2007)","journal-title":"Discret. Optim."},{"key":"293_CR42","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art, pp. 647\u2013686. Springer, Berlin Heidelberg (2010)"},{"key":"293_CR43","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"293_CR44","unstructured":"MOSEK ApS: MOSEK Modeling Cookbook. MOSEK ApS, Fruebjergvej 3, Boks 16, 2100 Copenhagen O (2024). https:\/\/docs.mosek.com\/modeling-cookbook\/index.html. Last revised April 2024"},{"key":"293_CR45","unstructured":"Ostrowski, J.: Symmetry in integer programming. Ph.D. thesis, Lehigh University, Bethlehem, PA (2008)"},{"key":"293_CR46","doi-asserted-by":"crossref","unstructured":"Ostrowski, J.: Symmetry Handling in Mixed-Integer Programming. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Ltd (2011)","DOI":"10.1002\/9780470400531.eorms0863"},{"key":"293_CR47","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smirglio, S.: Orbital branching. Math. Programming 126, 147\u2013178 (2011)","journal-title":"Math. Programming"},{"key":"293_CR48","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10107-019-01372-5","volume":"181","author":"F Permenter","year":"2020","unstructured":"Permenter, F., Parrillo, P.: Dimension reduction for semidefinite programs via jordan algebras. Math. Programming 181, 51\u201384 (2020)","journal-title":"Math. Programming"},{"key":"293_CR49","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12532-018-0140-y","volume":"11","author":"M Pfetsch","year":"2019","unstructured":"Pfetsch, M., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs. Math. Program. Comput. 11, 37\u201393 (2019)","journal-title":"Math. Program. Comput."},{"key":"293_CR50","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/11564751_36","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"JF Puget","year":"2005","unstructured":"Puget, J.F.: Automatic Detection of Variable and Value Symmetries. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming - CP 2005, pp. 475\u2013489. Springer, Berlin Heidelberg (2005)"},{"key":"293_CR51","unstructured":"Rehn, T.: Exploring Core Points for Fun and Profit: A Study Of Lattice-free Orbit Polytopes. Ph.D. thesis, University of Rostock, (2014)"},{"key":"293_CR52","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-15582-6_48","volume-title":"Mathematical Software - ICMS 2010","author":"T Rehn","year":"2010","unstructured":"Rehn, T., Sch\u00fcrmann, A.: C++ Tools for Exploiting Polyhedral Symmetries. In: Fukuda, K., Hoeven, J.V.D., Joswig, M., Takayama, N. (eds.) Mathematical Software - ICMS 2010, pp. 295\u2013298. Springer, Berlin, Heidelberg (2010)"},{"key":"293_CR53","unstructured":"Salvagnin, D.: A Dominance Procedure for Integer Programming. Master\u2019s thesis, University of Padova (2005)"},{"key":"293_CR54","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-38171-3_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D Salvagnin","year":"2013","unstructured":"Salvagnin, D.: Orbital Shrinking: A New Tool for Hybrid MIP\/CP Methods. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 204\u2013215. Springer, Berlin Heidelberg (2013)"},{"key":"293_CR55","doi-asserted-by":"publisher","first-page":"pp. 521","DOI":"10.1007\/978-3-319-93031-2_37","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"D Salvagnin","year":"2018","unstructured":"Salvagnin, D.: Symmetry Breaking Inequalities from the Schreier-Sims Table. In: van Hoeve, W.J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 521\u2013529. Springer International Publishing, Germany (2018)"},{"issue":"10","key":"293_CR56","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manage. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manage. Sci."},{"key":"293_CR57","unstructured":"Wiese, S.: A computational practicability study of MIQCQP reformulations. https:\/\/docs.mosek.com\/whitepapers\/miqcqp.pdf. Accessed May-08-2025"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00293-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00293-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00293-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T13:02:21Z","timestamp":1772629341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00293-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00293-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"10 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}