{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:03:34Z","timestamp":1743138214131,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030696245"},{"type":"electronic","value":"9783030696252"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-69625-2_10","type":"book-chapter","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:02:53Z","timestamp":1615766573000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9218-2301","authenticated-orcid":false,"given":"Damir","family":"Gainanov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3593-4383","authenticated-orcid":false,"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Varvara","family":"Rasskazova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,15]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a11040050","volume":"11","author":"A Lazarev","year":"2018","unstructured":"Lazarev, A., Pravdivets, N., Nekrasov, I.: Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem. Algorithms 11(4), 1\u201313 (2018)","journal-title":"Algorithms"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Matyukhin, V., Shabunin, A., Kuznetsov, N., Takmazian, A.: Rail transport control by combinatorial optimization approach. In: 11th IEEE International Conference on Application of Information and Communication Technologies, pp. 419\u2013422. IEEE Communications Society (2017)","DOI":"10.1109\/ICAICT.2017.8687244"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1111\/itor.12062","volume":"21","author":"F Piu","year":"2014","unstructured":"Piu, F., Speranza, M.: The locomotive assignment problem: a survey on optimization models. Int. Trans. Oper. Res. 21, 327\u2013352 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"11","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1134\/S0005117916110059","volume":"77","author":"SV Ivanov","year":"2016","unstructured":"Ivanov, S.V., Kibzun, A.I., Osokin, A.V.: Stochastic optimization model of locomotive assignment to freight trains. Autom. Remote Control 77(11), 1944\u20131956 (2016). https:\/\/doi.org\/10.1134\/S0005117916110059","journal-title":"Autom. Remote Control"},{"issue":"12","key":"10_CR5","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1134\/S0005117913120084","volume":"74","author":"AA Lazarev","year":"2013","unstructured":"Lazarev, A.A., Musatova, E.G.: The problem of trains formation and scheduling: integer statements. Autom. Remote Control 74(12), 2064\u20132068 (2013)","journal-title":"Autom. Remote Control"},{"issue":"4","key":"10_CR6","first-page":"73","volume":"9","author":"VM Azanov","year":"2016","unstructured":"Azanov, V.M., Buyanov, M.V., Gaynanov, D.N., Ivanov, S.V.: Algorithm and software development to allocate locomotives for transportation of freight trains. Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw. 9(4), 73\u201385 (2016)","journal-title":"Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/(SICI)1520-684X(199705)28:5<60::AID-SCJ7>3.0.CO;2-M","volume":"28","author":"E Tomita","year":"1997","unstructured":"Tomita, E., Imamatsu, K., Kohata, Y., Wakatsuki, M.: A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. Syst. Comput. Japan 28, 60\u201367 (1997)","journal-title":"Syst. Comput. Japan"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Abello, J., Pardalos, P.M., Resende, M.: On maximum clique problems in very large graphs. In: External Memory Algorithms, pp. 119\u2013130 (1999)","DOI":"10.1090\/dimacs\/050\/06"},{"key":"10_CR9","unstructured":"Gainanov, D., Mladenovi\u0107, N., Rasskazova, V., Uro\u0161evi\u0107, D.: Heuristic algorithm for finding the maximum independent set with absolute estimate of the accuracy. In: CEUR-Workshop Proceedings, vol. 2098, pp. 141\u2013149 (2018)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P Hansen","year":"2004","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search for the maximum clique. Discret. Appl. Math. 145(1), 117\u2013125 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"10_CR11","first-page":"17","volume":"9","author":"D Gainanov","year":"2016","unstructured":"Gainanov, D., Rasskazova, V.: An inference algorithm for monotone Boolean functions associated with undirected graphs. Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw. 9(3), 17\u201330 (2016)","journal-title":"Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0305-0548(90)90048-C","volume":"17","author":"A Hertz","year":"1990","unstructured":"Hertz, A., Friden, C., De Werra, D.: Tabaris: an exact algorithm based on tabu search for finding a maximum independent set in a graph. Comput. Oper. Res. 17, 437\u2013445 (1990)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.15302\/J-FEM-2018031","volume":"5","author":"D Gainanov","year":"2018","unstructured":"Gainanov, D., Mladenovi\u0107, N., Rasskazova, V.: Maximum independent set in planning freight railway transportation. Front. Eng. Manag. 5(4), 499\u2013506 (2018)","journal-title":"Front. Eng. Manag."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69625-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:15:27Z","timestamp":1615767327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69625-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030696245","9783030696252"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69625-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icvns2020.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}