{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:54Z","timestamp":1775947494713,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T00:00:00Z","timestamp":1415664000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11590-014-0824-9","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:15:07Z","timestamp":1415999707000},"page":"1703-1727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A semidefinite optimization approach to the Target Visitation Problem"],"prefix":"10.1007","volume":"9","author":[{"given":"P.","family":"Hungerl\u00e4nder","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,11]]},"reference":[{"key":"824_CR1","first-page":"10","volume":"26","author":"H Achatz","year":"2006","unstructured":"Achatz, H., Kleinschmidt, P., Lambsdorff, J.: Der corruption perceptions index und das linear ordering problem. ORNews 26, 10\u201312 (2006)","journal-title":"ORNews"},{"key":"824_CR2","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization Theory, Algorithms, Software and Applications. International Series in Operations Research and Management Science. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"824_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)","DOI":"10.1515\/9781400841103"},{"key":"824_CR4","doi-asserted-by":"crossref","unstructured":"Arulselvan, A., Commander, C., Pardalos, P.: A random keys based genetic algorithm for the target visitation problem. In: Advances in Cooperative Control and Optimization, pp. 389\u2013397. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74356-9_24"},{"key":"824_CR5","unstructured":"B\u00e9k\u00e9si, J., Galambos, G., Oswald, M., Reinelt, G.: Comparison of approaches for solving coupled task problems. Technical report, Ruprecht-Karls-Universit\u00e4t Heidelberg (2008)"},{"issue":"3","key":"824_CR6","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1016\/j.ejor.2006.03.071","volume":"189","author":"L Bertacco","year":"2008","unstructured":"Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345\u20131357 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"824_CR7","unstructured":"Boenchendorf, K.: Reihenfolgenprobleme\/mean-flow-time sequencing. Mathematical Systems in Economics 74. Verlagsgruppe Athen\u00c4aum, Hain, Scriptor (1982)"},{"key":"824_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)"},{"key":"824_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.2307\/1907514","volume":"26","author":"H Chenery","year":"1958","unstructured":"Chenery, H., Watanabe, T.: International comparisons of the structure of production. Econometrica 26, 487\u2013521 (1958)","journal-title":"Econometrica"},{"issue":"4","key":"824_CR10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/ijoc.1120.0525","volume":"25","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Hungerl\u00e4nder, P.: Exact approaches to multilevel vertical orderings. INFORMS J. Comput. 25(4), 611\u2013624 (2013)","journal-title":"INFORMS J. Comput."},{"key":"824_CR11","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Cranegie-Mellon University (1976)"},{"key":"824_CR12","unstructured":"Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2011)"},{"key":"824_CR13","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107, D., Cangalovi\u0107, M., Kova\u010devi\u010d-Vuj\u010di\u0107, V.: Semidefinite programming methods for the symmetric traveling salesman problem. In: Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 126\u2013136. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48777-8_10"},{"issue":"4","key":"824_CR14","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1137\/070711141","volume":"19","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19(4), 1559\u20131573 (2008)","journal-title":"SIAM J. Optim."},{"key":"824_CR15","doi-asserted-by":"crossref","unstructured":"Deza, M., Laurent, M.: Geometry of Cuts and Metrics, Volume 15 of Algorithms and Combinatorics. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-04295-9"},{"issue":"2","key":"824_CR16","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2011.07.036","volume":"216","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Mart\u00ed, R., \u00c1lvarez, A., \u00c1ngel-Bello, F.: Metaheuristics for the linear ordering problem with cumulative costs. Eur. J. Oper. Res. 216(2), 270\u2013277 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"824_CR17","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I Fischer","year":"2006","unstructured":"Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle method for semidefinite cutten plane relaxations of max-cut and equipartition. Math. Progr. 105, 451\u2013469 (2006)","journal-title":"Math. Progr."},{"issue":"1","key":"824_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0165-4896(92)90038-7","volume":"23","author":"PC Fishburn","year":"1992","unstructured":"Fishburn, P.C.: Induced binary probabilities and the linear ordering polytope: a status report. Math. Soc. Sci. 23(1), 67\u201380 (1992)","journal-title":"Math. Soc. Sci."},{"key":"824_CR19","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete problems. In: STOC \u201974: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47\u201363. Springer, New York (1974)","DOI":"10.1145\/800119.803884"},{"key":"824_CR20","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1287\/mnsc.20.8.1190","volume":"20","author":"F Glover","year":"1974","unstructured":"Glover, F., Klastorin, T., Klingman, D.: Optimal weighted ancestry relationships. Manag. Sci. 20, 1190\u20131193 (1974)","journal-title":"Manag. Sci."},{"key":"824_CR21","doi-asserted-by":"crossref","unstructured":"Grundel, D., Jeffcoat, D.: Formulation and solution of the target visitation problem. In: Proceedings of the AIAA 1st Intelligent Systems Technical Conference (2004)","DOI":"10.2514\/6.2004-6212"},{"key":"824_CR22","unstructured":"Gutin, G., Punnen, A.: The Traveling Salesman Problem and its Variations. Springer, Berlin (2002)"},{"key":"824_CR23","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"824_CR24","unstructured":"Hildenbrandt, A.: Benchmark instances for the TVP. http:\/\/comopt.ifi.uni-heidelberg.de\/people\/hildenbrandt\/TVP\/template.html"},{"key":"824_CR25","unstructured":"Hildenbrandt, A., Heismann, O., Reinelt, G.: The target visitation problem. In: Presentation held at the 18th Combinatorial Optimization Workshop in Aussois on January 09, 2014"},{"key":"824_CR26","unstructured":"Hildenbrandt, A., Reinelt, G., Heismann, O.: Integer programming models for the target visitation problem. In: Proceedings of the 16th International Multiconference of the Information Society, vol. A, pp. 569\u2013572 (2013)"},{"key":"824_CR27","unstructured":"Holub, H.-W., Schnabl, H.: Input-Output-Rechnung: Input-Output-Tabellen. Oldenbourg Wissenschaftsverlag (1982)"},{"key":"824_CR28","unstructured":"Hungerl\u00e4nder, P.: New semidefinite programming relaxations for the linear ordering and the traveling salesman problem. Technical report, Alpen-Adria Universit\u00e4t Klagenfurt, Mathematics, Optimization Group, TR-ARUK-M-O-14-03 (2014)"},{"issue":"1","key":"824_CR29","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10107-012-0627-7","volume":"140","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Progr. 140(1), 77\u201397 (2013a)","journal-title":"Math. Progr."},{"issue":"1","key":"824_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1), 1\u201320 (2013b)","journal-title":"Comput. Optim. Appl."},{"key":"824_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1\u201325 (1997)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"824_CR32","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4), 602\u2013626 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"824_CR33","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"issue":"1","key":"824_CR34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"issue":"3","key":"824_CR35","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/1927837","volume":"18","author":"W Leontief","year":"1936","unstructured":"Leontief, W.: Quantitative input-output relations in the economic system of the united states. Rev. Econ. Stat. 18(3), 105\u2013125 (1936)","journal-title":"Rev. Econ. Stat."},{"issue":"2","key":"824_CR36","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"824_CR37","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"824_CR38","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization. Applied Mathematical Sciences, Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-16729-4"},{"key":"824_CR39","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Reinelt, G., Duarte, A.: A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. 1\u201321 (2011)","DOI":"10.1007\/s10589-010-9384-9"},{"key":"824_CR40","doi-asserted-by":"crossref","unstructured":"Murphey, R., Pardalos, P. (eds.): Cooperative Control and Optimization. Springer, Berlin (2002)","DOI":"10.1007\/b130435"},{"key":"824_CR41","doi-asserted-by":"crossref","unstructured":"Newman, A.: Cuts and orderings: on semidefinite relaxations for the linear ordering problem. In: Jansen, K., Khanna, S., Rolim, J., Ron, D. (eds.) Lecture Notes in Computer Science, vol. 3122, pp. 195\u2013206. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-27821-4_18"},{"key":"824_CR42","doi-asserted-by":"crossref","unstructured":"Newman, A., Vempala, S.: Fences are futile: on relaxations for the linear ordering problem. In: Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 333\u2013347. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45535-3_26"},{"issue":"1","key":"824_CR43","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric Traveling Salesman Problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"824_CR44","unstructured":"Reinelt, G.: The traveling salesman: computational solutions for TSP applications. Springer, Berlin (1994)"},{"key":"824_CR45","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"212","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Progr. 212, 307\u2013335 (2010)","journal-title":"Math. Progr."},{"issue":"3\u20134","key":"824_CR46","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","volume":"48","author":"P Slater","year":"1961","unstructured":"Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48(3\u20134), 303\u2013312 (1961)","journal-title":"Biometrika"},{"key":"824_CR47","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"824_CR48","volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic, Boston (2000)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0824-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0824-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0824-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:32:40Z","timestamp":1598477560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0824-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,11]]},"references-count":48,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["824"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0824-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,11]]}}}