{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:10:54Z","timestamp":1740179454948,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T00:00:00Z","timestamp":1519776000000},"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":["Iran J Comput Sci"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s42044-018-0012-7","type":"journal-article","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T04:26:02Z","timestamp":1519791962000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint programming models and population-based simulated annealing algorithm for finding graceful and \n                \n                  \n                \n                $$\\alpha $$\n                \n                  \n                    \u03b1\n                  \n                \n              -labeling of quadratic graphs"],"prefix":"10.1007","volume":"1","author":[{"given":"Mohammad","family":"Amini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6691-0678","authenticated-orcid":false,"given":"Kourosh","family":"Eshghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,28]]},"reference":[{"key":"12_CR1","unstructured":"Eshghi, K.: Existence and construction of-labeling of 2-regular graphs with three components. PhD diss., Ph. D. thesis, University of Toronto (1997)"},{"key":"12_CR2","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb., 20th edn. 1\u2013415 (2017)"},{"issue":"11","key":"12_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1155\/S0161171204306010","volume":"2004","author":"K Eshghi","year":"2004","unstructured":"Eshghi, K.: Extension of \n                    \n                      \n                    \n                    $$\\alpha $$\n                    \n                      \n                        \u03b1\n                      \n                    \n                  -labelings of quadratic graphs. Int. J. Math. Math. Sci. 2004(11), 571\u2013578 (2004)","journal-title":"Int. J. Math. Math. Sci."},{"key":"12_CR4","unstructured":"Eshghi, K., Salarrezaie, M.: An integer programming model and a Tabu search algorithm to generate \n                    \n                      \n                    \n                    $$\\alpha $$\n                    \n                      \n                        \u03b1\n                      \n                    \n                  -labeling of special classes of quadratic graph. Iran. J. Oper. Res. (to appear)"},{"key":"12_CR5","unstructured":"Eshghi, K., Salarrezaie, M.: Existence and construction of \n                    \n                      \n                    \n                    $$\\alpha $$\n                    \n                      \n                        \u03b1\n                      \n                    \n                  -labeling for quadratic graph \n                    \n                      \n                    \n                    $$Q(7,4k)$$\n                    \n                      \n                        \n                          Q\n                          (\n                          7\n                          ,\n                          4\n                          k\n                          )\n                        \n                      \n                    \n                   and its extensions. Int. J. Graph. Theory Appl. (IJGTA) (to appear)"},{"key":"12_CR6","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, International Symposium, Rome, pp. 349\u2013355 (1966)"},{"issue":"0988","key":"12_CR7","first-page":"261","volume":"65","author":"J Abrham","year":"1988","unstructured":"Abrham, J., Kotzig, A.: On the missing value in a graceful numbering of a 2-regular graph. Congr. Numer. 65(0988), 261\u2013266 (1988)","journal-title":"Congr. Numer."},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/0095-8956(81)90031-9","volume":"31","author":"A Kotzig","year":"1981","unstructured":"Kotzig, A.: Decompositions of complete graphs into isomorphic cubes. J. Comb. Theory Ser. B 31(3), 292\u2013296 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.14429\/dsj.35.6001","volume":"35","author":"DR Lakshmi","year":"1985","unstructured":"Lakshmi, D.R., Vangipuram, S.: A note on the graceful numbering of a class of trees. Def. Sci. J. 35, 65\u201370 (1985)","journal-title":"Def. Sci. J."},{"key":"12_CR10","unstructured":"Salarrezaei, M.: Mathematical programming models for graceful labeling problem of 2-regular graphs. Master of Science thesis, Sharif University of Technology (2012)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/S1110757X04310065","volume":"1","author":"K Eshghi","year":"2004","unstructured":"Eshghi, K., Azimi, P.: Applications of mathematical programming in graceful labeling of graphs. J. Appl. Math. 1(1), 1\u20138 (2004)","journal-title":"J. Appl. Math."},{"key":"12_CR12","first-page":"163","volume":"72","author":"K Eshghi","year":"2007","unstructured":"Eshghi, K., Azimi, P.: An algorithm for finding a feasible solution of graph labeling problems. Utilitas Mathematica 72, 163\u2013174 (2007)","journal-title":"Utilitas Mathematica"},{"key":"12_CR13","first-page":"17","volume":"164","author":"TA Redl","year":"2003","unstructured":"Redl, T.A.: Graceful graphs and graceful labelings: two mathematical programming formulations and some other new results. Congressus Numerantium 164, 17\u201332 (2003)","journal-title":"Congressus Numerantium"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s10601-009-9071-6","volume":"15","author":"BM Smith","year":"2010","unstructured":"Smith, B.M., Puget, J.-F.: Constraint models for graceful graphs. Constraints 15(1), 64\u201392 (2010)","journal-title":"Constraints"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4018\/jamc.2010100103","volume":"1","author":"H Mahmoudzadeh","year":"2010","unstructured":"Mahmoudzadeh, H., Eshghi, K.: Metaheuristic approach to the graceful labeling problem. Int. J. Appl. Metaheuristic Comput. IJAMC 1, 42\u201357 (2010)","journal-title":"Int. J. Appl. Metaheuristic Comput. IJAMC"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cie.2016.07.022","volume":"99","author":"H Shaabani","year":"2016","unstructured":"Shaabani, H., Kamalabadi, I.N.: An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Comput. Ind. Eng. 99, 189\u2013201 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"4598","key":"12_CR17","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"12_CR18","first-page":"69","volume":"1","author":"DE Goldberg","year":"1991","unstructured":"Goldberg, D.E., Kalyanmoy, D.: A comparative analysis of selection schemes used in genetic algorithms. Found. Genet. Algorithms 1, 69\u201393 (1991)","journal-title":"Found. Genet. Algorithms"}],"container-title":["Iran Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42044-018-0012-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-018-0012-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-018-0012-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T23:32:28Z","timestamp":1551310348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42044-018-0012-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,28]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s42044-018-0012-7","relation":{},"ISSN":["2520-8438","2520-8446"],"issn-type":[{"type":"print","value":"2520-8438"},{"type":"electronic","value":"2520-8446"}],"subject":[],"published":{"date-parts":[[2018,2,28]]},"assertion":[{"value":"9 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}