A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
DOI10.1007/978-3-030-65739-0_6OpenAlexW3126111459MaRDI QIDQ6130875
Efim Polishchuk, A. A. Petunin, Stanislav Ukolov
Publication date: 3 April 2024
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_6
local searchheuristicvariable neighborhood searchdiscrete optimizationGTSPtool path problemcontinuous cutting problemsufficient conditions of global extremum
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A discrete-continuous routing problem with precedence constraints
- Variable neighbourhood search: methods and applications
- The Euclidean traveling salesman problem is NP-complete
- New classes of efficiently solvable generalized traveling salesman problems
- Approximation algorithms for the Geometric Covering Salesman Problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Approximation schemes for the generalized traveling salesman problem
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems
- A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
- Touring a sequence of polygons
- About Routing in the Sheet Cutting
This page was built for publication: A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
