{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:36:42Z","timestamp":1753180602233,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030336943"},{"type":"electronic","value":"9783030336950"}],"license":[{"start":{"date-parts":[[2019,11,2]],"date-time":"2019-11-02T00:00:00Z","timestamp":1572652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-33695-0_17","type":"book-chapter","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T16:04:57Z","timestamp":1572624297000},"page":"231-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quadratic Optimization Models and Convex Extensions on Permutation Matrix Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7099-8967","authenticated-orcid":false,"given":"Oksana","family":"Pichugina","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6736-371X","authenticated-orcid":false,"given":"Sergiy","family":"Yakovlev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-68891-4_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Armbruster","year":"2008","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Martin, A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 112\u2013124. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_8"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01721246","volume":"6","author":"A Bachem","year":"1984","unstructured":"Bachem, A., Euler, R.: Recent trends in combinatorial optimization. OR Spektrum 6, 1\u201321 (1984). https:\/\/doi.org\/10.1007\/BF01721246","journal-title":"OR Spektrum"},{"key":"17_CR3","volume-title":"Principes de combinatoire","author":"C Berge","year":"1968","unstructured":"Berge, C.: Principes de combinatoire. Dunod, Paris (1968)"},{"key":"17_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.-C.: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: the QCR method. Discrete Appl. Math. 157, 1185\u20131197 (2009). https:\/\/doi.org\/10.1016\/j.dam.2007.12.007","journal-title":"Discrete Appl. Math."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10852-012-9193-5","volume":"12","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Jarray, F., Tlig, G., Zagrouba, E.: Reconstructing convex matrices by integer programming approaches. J. Math. Model. Algor. 12, 329\u2013343 (2012). https:\/\/doi.org\/10.1007\/s10852-012-9193-5","journal-title":"J. Math. Model. Algor."},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721182","volume-title":"Combinatorial Matrix Classes","author":"RA Brualdi","year":"2006","unstructured":"Brualdi, R.A.: Combinatorial Matrix Classes. Cambridge University Press, Cambridge (2006)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1007\/978-1-4419-7997-1_22","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"2013","unstructured":"Burkard, R.E.: Quadratic assignment problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 2741\u20132814. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_22"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"1999","unstructured":"Burkard, R.E., \u00c7ela, E.: Linear assignment problems and extensions. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 75\u2013149. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_2"},{"key":"17_CR10","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E Cela","year":"2010","unstructured":"Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Springer, New York (2010)"},{"key":"17_CR11","volume-title":"Combinatorial Optimization","author":"WJ Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-59408-6_58","volume-title":"Integer Programming and Combinatorial Optimization","author":"Y Crama","year":"1995","unstructured":"Crama, Y., Spieksma, F.C.R.: Scheduling jobs of equal length: complexity, facets and computational results. In: Balas, E., Clausen, J. (eds.) Integer Programming and Combinatorial Optimization, pp. 277\u2013291. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59408-6_58"},{"volume-title":"Handbook of Combinatorial Designs","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs. Chapman and Hall, CRC Press, New York (2006)","key":"17_CR13"},{"unstructured":"Dahl, J.: Convex optimization in signal processing and communications (2003)","key":"17_CR14"},{"doi-asserted-by":"publisher","unstructured":"Farzad, B., Pichugina, O., Koliechkina, L.: Multi-layer community detection. In: 2018 International Conference on Control, Artificial Intelligence, Robotics Optimization (ICCAIRO), pp. 133\u2013140 (2018). https:\/\/doi.org\/10.1109\/ICCAIRO.2018.00030","key":"17_CR15","DOI":"10.1109\/ICCAIRO.2018.00030"},{"doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., G\u00fcm\u00fc\u015f, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Quadratic programming problems. In: Handbook of Test Problems in Local and Global Optimization, pp. 5\u201319. Springer, New York (1999)","key":"17_CR16","DOI":"10.1007\/978-1-4757-3040-1_2"},{"unstructured":"Stoyan, Yu.G., Sokolovskii, V.Z., Yakovlev, S.V.: Method of balancing rotating discretely distributed masses. Energomashinostroenie 2, 4\u20135 (1982)","key":"17_CR17"},{"doi-asserted-by":"publisher","unstructured":"Hulianytskyi, L., Riasna, I.: Formalization and classification of combinatorial optimization problems. In: Optimization Methods and Applications, pp. 239\u2013250. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68640-0_11","key":"17_CR18","DOI":"10.1007\/978-3-319-68640-0_11"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/0-306-48213-4_11","volume-title":"The Traveling Salesman Problem and Its Variations","author":"SN Kabadi","year":"2007","unstructured":"Kabadi, S.N.: Polynomially solvable cases of the TSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, pp. 489\u2013583. Springer, New York (2007). https:\/\/doi.org\/10.1007\/0-306-48213-4_11"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-1-4757-3155-2_6","volume-title":"Nonlinear Assignment Problems","author":"V Kaibel","year":"2000","unstructured":"Kaibel, V.: Polyhedral methods for the QAP. In: Pardalos, P.M., Pitsoulis, L.S. (eds.) Nonlinear Assignment Problems, pp. 109\u2013141. Springer, New York (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3155-2_6"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/978-1-4419-1153-7_1152","volume-title":"Encyclopedia of Operations Research and Management Science","author":"A Kammerdiner","year":"2013","unstructured":"Kammerdiner, A., Gevezes, T., Pasiliao, E., Pitsoulis, L., Pardalos, P.M.: Quadratic assignment problem. In: Gass, S.I., Fu, M.C. (eds.) Encyclopedia of Operations Research and Management Science, pp. 1193\u20131207. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-1153-7_1152"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/s10559-017-9961-3","volume":"53","author":"LM Koliechkina","year":"2017","unstructured":"Koliechkina, L.M., Dvirna, O.A.: Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality. Cybern. Syst. Anal. 53, 590\u2013599 (2017). https:\/\/doi.org\/10.1007\/s10559-017-9961-3","journal-title":"Cybern. Syst. Anal."},{"key":"17_CR23","first-page":"355","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications","author":"L Koliechkina","year":"2019","unstructured":"Koliechkina, L., Pichugina, O.: A horizontal method of localizing values of a linear function in permutation-based optimization. In: Le Thi, H.A., Le, H.M., Pham Dinh, T. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications, pp. 355\u2013364. Springer, Cham (2019)"},{"key":"17_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2012)"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.cor.2015.07.008","volume":"66","author":"N Krislock","year":"2016","unstructured":"Krislock, N., Malick, J., Roupin, F.: Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Comput. Oper. Res. 66, 153\u2013159 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.07.008","journal-title":"Comput. Oper. Res."},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9, 586\u2013599 (1963)","journal-title":"Manage. Sci."},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011985908177","volume":"37","author":"VP Mashtalir","year":"2001","unstructured":"Mashtalir, V.P., Yakovlev, S.V.: Point-set methods of clusterization of standard information. Cybern. Syst. Anal. 37(3), 295\u2013307 (2001). https:\/\/doi.org\/10.1023\/A:1011985908177","journal-title":"Cybern. Syst. Anal."},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45535-3_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"AJ Miller","year":"2001","unstructured":"Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.P.: Facets, algorithms, and polyhedral characterizations for a multi-item production planning model with setup times. In: Aardal, K., Gerards, B. (eds.) Integer Programming and Combinatorial Optimization, pp. 318\u2013332. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_25"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-69346-7_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Nakamura","year":"1998","unstructured":"Nakamura, D., Tamura, A.: The generalized stable set problem for claw-free bidirected graphs. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) Integer Programming and Combinatorial Optimization, pp. 69\u201383. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69346-7_6"},{"key":"17_CR30","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"2013","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Mineola (2013)"},{"key":"17_CR31","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2002)"},{"unstructured":"Pardalos, P.M., Wolkowicz, H.: Quadratic Assignment and Related Problems: DIMACS Workshop, 20\u201321 May 1993. American Mathematical Soc. (1994)","key":"17_CR32"},{"doi-asserted-by":"publisher","unstructured":"Pichugina, O.: Placement problems in chip design: modeling and optimization. In: 2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T), pp. 465\u2013473 (2017). https:\/\/doi.org\/10.1109\/INFOCOMMST.2017.8246440","key":"17_CR33","DOI":"10.1109\/INFOCOMMST.2017.8246440"},{"unstructured":"Pichugina, O., Farzad, B.: A human communication network model. In: CEUR Workshop Proceedings, KNU, Kyiv, pp. 33\u201340 (2016)","key":"17_CR34"},{"doi-asserted-by":"publisher","unstructured":"Pichugina, O., Kartashov, O.: Signed permutation polytope packing in VLSI design. In: 2019 IEEE 15th International Conference on the Experience of Designing and Application of CAD Systems (CADSM) Conference Proceedings, Lviv, pp. 4\/50\u20134\/55 (2019). https:\/\/doi.org\/10.1109\/CADSM.2019.8779353","key":"17_CR35","DOI":"10.1109\/CADSM.2019.8779353"},{"issue":"6","key":"17_CR36","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s10559-016-9894-2","volume":"52","author":"OS Pichugina","year":"2016","unstructured":"Pichugina, O.S., Yakovlev, S.V.: Continuous representations and functional extensions in combinatorial optimization. Cybern. Syst. Anal. 52(6), 921\u2013930 (2016). https:\/\/doi.org\/10.1007\/s10559-016-9894-2","journal-title":"Cybern. Syst. Anal."},{"key":"17_CR37","doi-asserted-by":"publisher","first-page":"27","DOI":"10.15587\/1729-4061.2016.58550","volume":"79","author":"OS Pichugina","year":"2016","unstructured":"Pichugina, O.S., Yakovlev, S.V.: Functional and analytic representations of the general permutation. Eastern-Eur. J. Enterp. Technol. 79, 27\u201338 (2016). https:\/\/doi.org\/10.15587\/1729-4061.2016.58550","journal-title":"Eastern-Eur. J. Enterp. Technol."},{"doi-asserted-by":"publisher","unstructured":"Pichugina, O., Yakovlev, S.: Optimization on polyhedral-spherical sets: theory and applications. In: 2017 IEEE 1st Ukraine Conference on Electrical and Computer Engineering, UKRCON 2017 - Proceedings, KPI, Kiev, pp. 1167\u20131174 (2017). https:\/\/doi.org\/10.1109\/UKRCON.2017.8100436","key":"17_CR38","DOI":"10.1109\/UKRCON.2017.8100436"},{"key":"17_CR39","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-26474-1_5","volume-title":"Lecture Notes in Computational Intelligence and Decision Making","author":"O Pichugina","year":"2019","unstructured":"Pichugina, O., Yakovlev, S.: Euclidean combinatorial configurations: continuous representations and convex extensions. In: Lytvynenko, V., Babichev, S., W\u00f3jcik, W., Vynokurova, O., Vyshemyrskaya, S., Radetskaya, S. (eds.) Lecture Notes in Computational Intelligence and Decision Making, pp. 65\u201380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26474-1_5"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.1007\/0-306-48332-7_405","volume-title":"Encyclopedia of Optimization","author":"L Pitsoulis","year":"2001","unstructured":"Pitsoulis, L., Pardalos, P.M.: Quadratic assignment problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2075\u20132107. Springer, New York (2001). https:\/\/doi.org\/10.1007\/0-306-48332-7_405"},{"key":"17_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1615\/JAutomatInfScien.v42.i2.50","volume":"42","author":"NV Semenova","year":"2010","unstructured":"Semenova, N.V., Kolechkina, L.N., Nagornaya, A.N.: One approach to solving vector problems with fractionally linear functions of the criteria on the combinatorial set of arrangements. J. Autom. Inf. Sci. 42, 67\u201380 (2010). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v42.i2.50","journal-title":"J. Autom. Inf. Sci."},{"key":"17_CR42","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/s10559-009-9134-0","volume":"45","author":"IV Sergienko","year":"2009","unstructured":"Sergienko, I.V., Hulianytskyi, L.F., Sirenko, S.I.: Classification of applied methods of combinatorial optimization. Cybern. Syst. Anal. 45, 732 (2009). https:\/\/doi.org\/10.1007\/s10559-009-9134-0","journal-title":"Cybern. Syst. Anal."},{"key":"17_CR43","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1615\/JAutomatInfScien.v48.i1.30","volume":"48","author":"IV Sergienko","year":"2016","unstructured":"Sergienko, I.V., Shylo, V.P.: Modern approaches to solving complex discrete optimization problems. J. Autom. Inf. Sci. 48, 15\u201324 (2016). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v48.i1.30","journal-title":"J. Autom. Inf. Sci."},{"key":"17_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"17_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1014004625997","volume":"23","author":"NZ Shor","year":"2002","unstructured":"Shor, N.Z., Stetsyuk, P.I.: Lagrangian bounds in multiextremal polynomial and discrete optimization problems. J. Global Optim. 23, 1\u201341 (2002). https:\/\/doi.org\/10.1023\/A:1014004625997","journal-title":"J. Global Optim."},{"key":"17_CR46","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10559-016-9801-x","volume":"52","author":"PI Stetsyuk","year":"2016","unstructured":"Stetsyuk, P.I.: Problem statements for k-node shortest path and k-node shortest cycle in a complete graph. Cybern. Syst. Anal. 52, 71\u201375 (2016). https:\/\/doi.org\/10.1007\/s10559-016-9801-x","journal-title":"Cybern. Syst. Anal."},{"key":"17_CR47","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01069996","volume":"25","author":"SV Yakovlev","year":"1989","unstructured":"Yakovlev, S.V.: Bounds on the minimum of convex functions on Euclidean combinatorial sets. Cybernetics 25, 385\u2013391 (1989). https:\/\/doi.org\/10.1007\/BF01069996","journal-title":"Cybernetics"},{"key":"17_CR48","first-page":"1112","volume":"34","author":"SV Yakovlev","year":"1994","unstructured":"Yakovlev, S.V.: The theory of convex continuations of functions on vertices of convex polyhedra. Comp. Math. Math. Phys. 34, 1112\u20131119 (1994)","journal-title":"Comp. Math. Math. Phys."},{"key":"17_CR49","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/BF01125802","volume":"29","author":"SV Yakovlev","year":"1993","unstructured":"Yakovlev, S.V., Grebennik, I.V.: Localization of solutions of some problems of nonlinear integer optimization. Cybern. Syst. Anal. 29, 727\u2013734 (1993). https:\/\/doi.org\/10.1007\/BF01125802","journal-title":"Cybern. Syst. Anal."},{"doi-asserted-by":"crossref","unstructured":"Yakovlev, S., Pichugina, O.: On constrained optimization of polynomials on permutation set. In: Proceedings of the Second International Workshop on Computer Modeling and Intelligent Systems (CMIS-2019), CEUR Vol-2353 urn:nbn:de:0074-2353-0, Zaporizhzhia, Ukraine, pp. 570\u2013580 (2019)","key":"17_CR50","DOI":"10.32782\/cmis\/2353-45"},{"key":"17_CR51","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1023\/A:1014374926840","volume":"53","author":"SV Yakovlev","year":"2001","unstructured":"Yakovlev, S.V., Valuiskaya, O.A.: Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints. Ukr. Math. J. 53, 1535\u20131545 (2001). https:\/\/doi.org\/10.1023\/A:1014374926840","journal-title":"Ukr. Math. J."},{"doi-asserted-by":"publisher","unstructured":"Yakovlev, S., Pichugina, O., Yarovaya, O.: On optimization problems on the polyhedral-spherical configurations with their properties. In: 2018 IEEE First International Conference on System Analysis Intelligent Computing (SAIC), pp. 94\u2013100 (2018). https:\/\/doi.org\/10.1109\/SAIC.2018.8516801","key":"17_CR52","DOI":"10.1109\/SAIC.2018.8516801"},{"key":"17_CR53","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1615\/JAutomatInfScien.v51.i1.30","volume":"51","author":"S Yakovlev","year":"2019","unstructured":"Yakovlev, S., Pichugina, O., Yarovaya, O.: Polyhedral-spherical configurations in discrete optimization problems. J. Autom. Inf. Sci. 51, 26\u201340 (2019). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v51.i1.30","journal-title":"J. Autom. Inf. Sci."},{"key":"17_CR54","volume-title":"Polytopes, Graphs and Optimisation","author":"VA Yemelichev","year":"1984","unstructured":"Yemelichev, V.A., Kovalev, M.M., Kravtsov, M.K.: Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge (1984)"},{"key":"17_CR55","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10878-013-9655-3","volume":"30","author":"Y Xia","year":"2013","unstructured":"Xia, Y., Gharibi, W.: On improving convex quadratic programming relaxation for the quadratic assignment problem. J. Comb. Optim. 30, 647\u2013667 (2013)","journal-title":"J. Comb. Optim."},{"key":"17_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98977-8","volume-title":"Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications","author":"MZ Zgurovsky","year":"2019","unstructured":"Zgurovsky, M.Z., Pavlov, A.A.: Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications. Springer, Cham (2019)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Intelligent Systems and Computing IV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33695-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T07:45:48Z","timestamp":1664783148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33695-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,2]]},"ISBN":["9783030336943","9783030336950"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33695-0_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,11,2]]},"assertion":[{"value":"2 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computer Science and Information Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ukraine","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csit2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}