A Novel Algorithm for Construction of the Shortest Path Between a Finite Set of Nonintersecting Contours on the Plane › Research Explorer

A Novel Algorithm for Construction of the Shortest Path Between a Finite Set of Nonintersecting Contours on the Plane

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

DOI

https://doi.org/10.1007/978-3-030-65739-0_6
Final published version

Original language	English
Title of host publication	Advances in Optimization and Applications - 11th International Conference, OPTIMA 2020, Revised Selected Papers
Editors	Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova
Publisher	Springer
Pages	70-83
Number of pages	14
ISBN (Print)	9783030657383
DOIs	https://doi.org/10.1007/978-3-030-65739-0_6
Publication status	Published - 2020
Event	11th International Conference on Optimization and Applications, OPTIMA 2020 - Moscow, Russian Federation Duration: 28 Sept 2020 → 2 Oct 2020

Publication series

Name	Communications in Computer and Information Science
Volume	1340
ISSN (Print)	1865-0929
ISSN (Electronic)	1865-0937

Conference

Conference	11th International Conference on Optimization and Applications, OPTIMA 2020
Country/Territory	Russian Federation
City	Moscow
Period	28/09/2020 → 02/10/2020

Research areas

Continuous cutting problem, Discrete optimization, GTSP, Heuristic, Local search, Sufficient conditions of global extremum, Tool path problem, Variable neighborhood search

ASJC Scopus subject areas

Computer Science(all)
Mathematics(all)

ID: 21029511