{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:57:02Z","timestamp":1765976222263},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10957-018-1334-1","type":"journal-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T18:16:11Z","timestamp":1529432171000},"page":"914-934","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks"],"prefix":"10.1007","volume":"178","author":[{"given":"Behrooz","family":"Alizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esmaeil","family":"Afrashteh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahimeh","family":"Baroughi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"key":"1334_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"133","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discrete Appl. Math. 133, 3\u201328 (2003)","journal-title":"Discrete Appl. Math."},{"key":"1334_CR2","first-page":"109","volume":"36","author":"F Plastria","year":"1996","unstructured":"Plastria, F.: Optimal location of undesirable facilities: a selective overview. Belg. J. Oper. Res. Stat. Comput. Sci. 36, 109\u2013127 (1996)","journal-title":"Belg. J. Oper. Res. Stat. Comput. Sci."},{"key":"1334_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"R Zanjirani","year":"2009","unstructured":"Zanjirani, R., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Physica-Verlag, Berlin (2009)"},{"key":"1334_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2004","unstructured":"Burkard, R.E., Pleschiutsching, C., Zhang, J.: Inverse median problems. Discrete Optim. 1, 23\u201339 (2004)","journal-title":"Discrete Optim."},{"key":"1334_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"RE Burkard","year":"2007","unstructured":"Burkard, R.E., Pleschiutsching, C., Zhang, J.: The inverse 1-median problem on a cycle. Discrete Optim. 5, 242\u2013253 (2007)","journal-title":"Discrete Optim."},{"key":"1334_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard, R.E., Galavii, M., Gassner, E.: The inverse Fermat\u2013Weber problem. Eur. J. Oper. Res. 206, 11\u201317 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1334_CR7","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/j.endm.2010.05.144","volume":"36","author":"J Hatzl","year":"2010","unstructured":"Hatzl, J.: The 1-median problem in \n                    \n                      \n                    \n                    $${{\\mathbb{R}}^{d}}$$\n                    \n                      \n                        \n                          \n                            R\n                          \n                          d\n                        \n                      \n                    \n                   with the Chebyshev-norm and its inverse problem. Electron. Notes Discrete Math. 36, 1137\u20131144 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"1334_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10100-009-0114-2","volume":"18","author":"Bonab F Baroughi","year":"2010","unstructured":"Baroughi, Bonab F., Burkard, R.E., Alizadeh, B.: Inverse median location problems with variable coordinates. Cent. Eur. J. Oper. Res. 18, 365\u2013381 (2010)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"1334_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00186-011-0346-5","volume":"73","author":"Bonab F Baroughi","year":"2011","unstructured":"Baroughi, Bonab F., Burkard, R.E., Gassner, E.: Inverse \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problems with variable edge lengths. Math. Methods Oper. Res. 73, 263\u2013280 (2011)","journal-title":"Math. Methods Oper. Res."},{"key":"1334_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"XC Guan","year":"2012","unstructured":"Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54, 75\u201382 (2012)","journal-title":"J. Glob. Optim."},{"key":"1334_CR11","first-page":"595","volume":"64","author":"AR Sepasian","year":"2015","unstructured":"Sepasian, A.R., Rahbarnia, F.: An \n                    \n                      \n                    \n                    $$ \\cal{O}(n \\log n) $$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          log\n                          n\n                          )\n                        \n                      \n                    \n                   algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64, 595\u2013602 (2015)","journal-title":"Optimization"},{"key":"1334_CR12","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"168","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T.: Inverse 1-median problem on block graphs with variable vertex weights. J. Optim. Theory. App. 168, 944\u2013957 (2016)","journal-title":"J. Optim. Theory. App."},{"key":"1334_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.7494\/OpMath.2016.36.4.513","volume":"36","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T., Linh Chi, N.T.: A model for the inverse 1-median problem on trees under uncertain costs. Opuscula Math. 36, 513\u2013523 (2016)","journal-title":"Opuscula Math."},{"key":"1334_CR14","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/s12597-016-0296-z","volume":"54","author":"B Alizadeh","year":"2017","unstructured":"Alizadeh, B., Bakhteh, S.: A modified firefly algorithm for general inverse \n                    \n                      \n                    \n                    $$ p $$\n                    \n                      \n                        p\n                      \n                    \n                  -median location problems under different distance norms. Opsearch 54, 618\u2013636 (2017)","journal-title":"Opsearch"},{"key":"1334_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20427","volume":"58","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58, 190\u2013200 (2011)","journal-title":"Networks"},{"key":"1334_CR16","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.dam.2011.01.009","volume":"159","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh, B., Burkard, R.E.: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Appl. Math. 159, 706\u2013716 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1334_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00607-009-0070-7","volume":"86","author":"B Alizadeh","year":"2009","unstructured":"Alizadeh, B., Burkard, R.E., Pferschy, U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86, 331\u2013343 (2009)","journal-title":"Computing"},{"key":"1334_CR18","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1007\/s10878-015-9907-5","volume":"32","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T., Sepasian, A.R.: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J. Comb. Optim. 32, 872\u2013884 (2016)","journal-title":"J. Comb. Optim."},{"key":"1334_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner, E.: The inverse 1-maxian problem with edge length modification. J. Comb. Optim. 16, 50\u201367 (2008)","journal-title":"J. Comb. Optim."},{"key":"1334_CR20","unstructured":"Galavii, M.: Inverse 1-Median Problems. Ph.D. Thesis, Graz University of Technology (2008)"},{"key":"1334_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10100-012-0248-5","volume":"21","author":"B Alizadeh","year":"2012","unstructured":"Alizadeh, B., Burkard, R.E.: A linear time algorithm for inverse obnoxious center location problems on networks. Cent. Eur. J. Oper. Res. 21, 585\u2013594 (2012)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"1334_CR22","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.11650\/tjm.20.2016.6296","volume":"20","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T., Vui, P.T.: The inverse \n                    \n                      \n                    \n                    $$ p $$\n                    \n                      \n                        p\n                      \n                    \n                  -maxian problem on trees with variable edge lengths. Taiwan. J. Math. 20, 1437\u20131449 (2016)","journal-title":"Taiwan. J. Math."},{"key":"1334_CR23","unstructured":"Alizadeh, B., Afrashteh, E., Baroughi, F.: Inverse Obnoxious \n                    \n                      \n                    \n                    $$ p $$\n                    \n                      \n                        p\n                      \n                    \n                  -Median Location Problems on Trees with Edge Length Modifications Under Different Norms. Personal communication (2016)"},{"key":"1334_CR24","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.orl.2006.03.016","volume":"35","author":"RE Burkard","year":"2007","unstructured":"Burkard, R.E., Fathali, J., Kakhki, H.T.: The \n                    \n                      \n                    \n                    $$ p $$\n                    \n                      \n                        p\n                      \n                    \n                  -maxian problem on a tree. Oper. Res. Lett. 35, 331\u2013335 (2007)","journal-title":"Oper. Res. Lett."},{"key":"1334_CR25","volume-title":"Combinatorial Optimization: Theory and Algorithms","year":"2012","unstructured":"Korte, B., Vygen, J. (eds.): Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2012)"},{"key":"1334_CR26","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"1334_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/rsa.20290","volume":"36","author":"M Drmota","year":"2010","unstructured":"Drmota, M., Gimenez, O., Noy, M.: Vertices of given degree in series-parallel graphs. Random Struct. Algorithm 36, 273\u2013314 (2010)","journal-title":"Random Struct. Algorithm"},{"key":"1334_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"MR Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 3\u201323 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"1334_CR29","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"1334_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"1334_CR31","volume-title":"Data Structures and Algorithms in C++","author":"MT Goodrich","year":"2003","unstructured":"Goodrich, M.T., Tamassia, R., Mount, D.: Data Structures and Algorithms in C++. Wiley, New York (2003)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1334-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1334-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1334-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:16:42Z","timestamp":1560899802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1334-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,19]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1334"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1334-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,19]]},"assertion":[{"value":"28 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}