naa a22 4500 510811388 CHVBK 20180411083444.0 cr unu---uuuuu 180411e20131201xx s 000 0 eng 10.1134/S0081543813090034 doi (NATIONALLICENCE)springer-10.1134/S0081543813090034 On an iterative procedure for solving a routing problem with constraints [Elektronische Daten] [A. Chentsov, A. Chentsov] The generalized precedence constrained traveling salesman problem is considered in the case when travel costs depend explicitly on the list of tasks that have not been performed (by the time of the travel). The original routing problem with dependent variables is represented in terms of an equivalent extremal problem with independent variables. An iterative method based on this representation is proposed for solving the original problem. The algorithm based on this method is implemented as a computer program. Pleiades Publishing, Ltd., 2013 route nationallicence precedence constraints nationallicence extremal problem nationallicence Chentsov A. Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi 16, 620990, Yekaterinburg, Russia aut Proceedings of the Steklov Institute of Mathematics Springer US; http://www.springer-ny.com 283(2013-12-01), 24-45 0081-5438 283<24 2013 283 11501 https://doi.org/10.1134/S0081543813090034 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1134/S0081543813090034 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Chentsov A. Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi 16, 620990, Yekaterinburg, Russia aut NATIONALLICENCE 773 0- Proceedings of the Steklov Institute of Mathematics Springer US; http://www.springer-ny.com 283(2013-12-01), 24-45 0081-5438 283<24 2013 283 11501 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer