A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Euclidean TSP in Narrow Strip
[article]
2020
arXiv
pre-print
Preserved Fulltext
We investigate how the complexity of Euclidean TSP for point sets P inside the strip (-∞,+∞)× [0,δ] depends on the strip width δ. We obtain two main results. ...
First, for the case where the points have distinct integer x-coordinates, we prove that a shortest bitonic tour (which can be computed in O(nlog^2 n) time using an existing algorithm) is guaranteed to ...
In particular, we assume that the point set P is contained in the strip (−∞, ∞) × [0, δ] for some relatively small δ and investigate how the complexity of Euclidean TSP depends on the parameter δ. ...
arXiv:2003.09948v1
fatcat:6edpst6lajfjjjkytyrauwuwtm
Euclidean TSP in Narrow Strips
2020
International Symposium on Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We investigate how the complexity of {Euclidean TSP} for point sets P inside the strip (-∞,+∞)×[0,δ] depends on the strip width δ. ...
. - For the case where the points have distinct integer x-coordinates, we prove that a shortest bitonic tour (which can be computed in O(n log²n) time using an existing algorithm) is guaranteed to be a ...
Euclidean TSP in Narrow Strips Recall that each edge e ∈ F is obtained from the corresponding edge e ∈ F by moving one or both endpoints along the edge e itself. ...
doi:10.4230/lipics.socg.2020.4
dblp:conf/compgeom/AlkemaBK20
fatcat:4ah6z65wgraktjd4ql7ulnyohi
Watchman tours for polygons with holes
2012
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
A watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon such that every point in the polygon is visible from at least one point of the tour. ...
Apart from the multiplicative constant, this bound is tight in the worst case. We then generalize our result to watchman tours in polyhedra with holes in 3-space. ...
The authors are grateful to two anonymous reviewers for uncovering gaps in our initial formulation of Theorem 2 and in the NP-hardness proof. ...
doi:10.1016/j.comgeo.2012.02.001
fatcat:tm6bk6627jhjpcsfiumbw3bg5q
An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows
2021
2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We develop a continuous asymptotic approximation of the traveling salesman problem with time windows in the Euclidean plane, constructing upon the well-known Beardwood-Halton-Hemmersley theorem. ...
Computational experiments on random TSP with time windows instances show that the proposed asymptotic approximations of tour lengths and arrival times are close to the actual optimal values. ...
Noting that the BHH formula underestimates tour lengths in elongated areas, Daganzo [5] proposed a strip strategy method, which efficiently computes the optimal tour length in those types of areas. ...
doi:10.1109/case49439.2021.9551615
fatcat:itort2njifgqro6zwrol3jcyhi
Traveling Salesman Problem Based Auto-Router for Designing LEDs Applications with Conductive Inkjet Printing
2018
SICE Journal of Control Measurement and System Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It is possible to try existing auto-routers in computer aided design tools to automatically route these LEDs. ...
In this paper, we propose an LED auto-router which computationally generates a conductive pattern to balance brightness of multiple LEDs without the need of additional resistors. ...
Fig. 10 10 Conversion of an excessively narrow conductive strip to its equivalent meander line. ...
doi:10.9746/jcmsi.11.292
fatcat:pxkhqqmp45asbbdgnt2erxemru
Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled "The lawnmower problem" and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466
2000
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we give a simple 6 5 -approximation algorithm for the TSP problem in simple grid graphs, which leads to an 11 5 -approximation algorithm for milling simple rectilinear polygons. ...
The lawn mowing problem arises in optical inspection, spray painting, and optimal search planning. Both problems are NP-hard in general. ...
(These problems are clearly NP-hard, from the fact that the Euclidean TSP is NP-hard.) ...
doi:10.1016/s0925-7721(00)00015-8
fatcat:hqojeebebzdy3ifnh7tqgump5e
Points on Computable Curves
2006
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we characterize those points of Euclidean space that lie on computable curves of finite length. ...
The "analyst's traveling salesman theorem" of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. ...
Note that if all these points involved lie in a very narrow strip, it is guaranteed that the newly added line segments are very close to the longer line segment they replace. ...
doi:10.1109/focs.2006.63
dblp:conf/focs/GuLM06
fatcat:faiqvhutn5eaddpnnizylipje4
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
2011
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Often, these two notions go hand-in-hand. Acknowlegement. We thank Annette Beyer and Angelika Mueller-von Brochowski for their continuous support and help in organizing this workshop. ...
Nevertheless, practical necessity dictates that acceptable solutions be found in a reasonable time. ...
In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + for any > 0. ...
doi:10.4230/dagrep.1.6.24
dblp:journals/dagstuhl-reports/DyerFFK11
fatcat:lb4xum4yizgo5iwrwau7d5csiy
EFFICIENT TOUR PLANNING FOR A MEASUREMENT VEHICLE BY COMBINING NEXT BEST VIEW AND TRAVELING SALESMAN
2021
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we formulate the basic problem, discuss it in context of the existing literature and present an iterative solution algorithm. ...
Combining both problems results in a new variation of the Traveling Salesman Problem, which we refer to as the Explorational Traveling Salesman Problem. ...
Arc costs are initialized with the Euclidean distance. ...
doi:10.5194/isprs-archives-xliii-b2-2021-729-2021
fatcat:2iv7rrgeo5fzniad36rekwibiu
Minimal link visibility paths inside a simple polygon
1993
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Specifically, given a set S of points (edges) in P, the problems of finding a tour with a minimum number of turns that visits each point (edge) in S exactly once are also shown to be NP-hard. ...
In proving this main result, we show two other related problems to be NP-hard as well. ...
As shown in Fig. 8a and 8b, P is identical to P' except for the addition of two polygonal narrow strips of n turns each, where n is the number of edges in P'. ...
doi:10.1016/0925-7721(93)90027-4
fatcat:gm76skgvsfejnmyqgdaicbmr4e
Approximation algorithms for TSP with neighborhoods in the plane
2003
Journal of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. ...
As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. ...
the case of the Euclidean TSP on points, as in [17] . ...
doi:10.1016/s0196-6774(03)00047-6
fatcat:rlapyt5655cxvd7mnaella63py
Rectilinear Steiner Trees in Narrow Strips
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A rectilinear Steiner tree for a set P of points in ℝ^2 is a tree that connects the points in P using horizontal and vertical line segments. ...
We investigate how the complexity of Minimal Rectilinear Steiner Tree for point sets P inside the strip (-∞,+∞)× [0,δ] depends on the strip width δ. ...
If the point set in P is "almost 1-dimensional" in the sense that the points lie in a narrow strip R × [0, δ], then can we solve Minimum Rectilinear Steiner Tree more efficiently than in the general case ...
arXiv:2103.08354v1
fatcat:zozhwmlf6ratpjopb3zgaktdby
Matrix Encoding Networks for Neural Combinatorial Optimization
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we introduce Matrix Encoding Network (MatNet) and show how conveniently it takes in and processes parameters of such complex CO problems. ...
Many CO problems of practical importance can be specified in a matrix form of parameters quantifying the relationship between two groups of items. ...
We thank Kevin Tierney for reviewing the MIP methods used in our experiments and giving us helpful tips and comments. We declare no third party funding or support. ...
arXiv:2106.11113v2
fatcat:lubohgrzmjchdfopse3iadhtkq
Evolving Combinatorial Problem Instances That Are Difficult to Solve
2006
Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Problem instances acquired through this technique are more difficult than ones found in popular benchmarks. ...
We analyse these evolved instances with the aim to explain their difficulty in terms of structural properties, thereby exposing the weaknesses of corresponding algorithms. ...
Figure 13 : 13 Two typical examples of the Euclidean TSP problem, both clustered usingGDBSCAN (eps=41,m=5). ...
doi:10.1162/evco.2006.14.4.433
pmid:17109606
fatcat:togz2qqffrcptjkiwwbke42vl4
Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity
2006
Transportation Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The resulting narrow gap between them under realistic operating conditions allows us to evaluate the service in terms of velocity and capacity versus demand. ...
The relationships obtained can be helpful in the design of MAST systems to set the main parameters of the service, such as slack time and headway. ...
Acknowledgments The research reported in this paper was partially supported by the National Science Foundation under Grant NSF/USDOT-0231665. ...
doi:10.1287/trsc.1050.0137
fatcat:sqwxmo77sjdhrm7ufj5j7atl5q
« Previous
Showing results 1 — 15 out of 94 results