The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 4215 of Mathematical Reviews Vol. , Issue 94g
[page]
1994
Mathematical Reviews
Preserved Fulltext
(NL-AMSTEC-OR; Amsterdam)
Bounds for the symmetric 2-peripatetic salesman problem. (English summary)
Optimization 23 (1992), no. 4, 357-367. ...
Here we give a brief survey of the fundamental results concerning the properties and algorithms for solving the Steiner problem on a Euclidean plane, the Steiner problem on a plane with a rectangular metric ...
Page 1415 of Mathematical Reviews Vol. , Issue 99b
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “The 2-peripatetic salesman problem (2-PSP) is the problem in which 2 edge-disjoint Hamiltonian cycles of minimal total length are required. ...
(NL-AMST-EC; Amsterdam) ; Volgenant, A. (NL-AMST-EC; Amsterdam) Well-solved cases of the 2-peripatetic salesman problem. (English summary) Optimization 39 (1997), no. 3, 275-293. ...
Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension
2016
IFAC-PapersOnLine
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.
For the Euclidean Min-k-SCCP in R d , we construct a polynomial-time approximation scheme, which generalizes the approach proposed earlier for the planar Min-2-SCCP. ...
For the Euclidean Min-k-SCCP in R d , we construct a polynomial-time approximation scheme, which generalizes the approach proposed earlier for the planar Min-2-SCCP. ...
ACKNOWLEDGEMENTS This research was supported by the Russian Science Foundation, grant No. 14-11-00109. ...
doi:10.1016/j.ifacol.2016.07.541
fatcat:jzsopddbcfb4zjne2ij4lnpsha
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
2009
Discrete Applied Mathematics
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.
The NP-hard problem of finding two edge-disjoint Hamiltonian cycles of minimal total weight (also known as 2-PSP min ) in a complete (undirected) graph with edge weights 1 and 2 is considered. ...
Polynomial time approximation algorithms are proposed with performance ratios 5/4 (in the case of one weight function) and 11/7 (in the case of two weight functions), respectively. ...
Acknowledgments Useful comments and suggestions of the two anonymous referees are gratefully acknowledged. This work was supported by grants RFBR (project 05-01-00395) and INTAS (project 04-77-7173). ...
doi:10.1016/j.dam.2008.06.025
fatcat:zsmp4bjmlvb3zc3j7evcvcex3a
Page 6994 of Mathematical Reviews Vol. , Issue 91M
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(NL-AMST-EC)
Lower bounds for symmetric K -peripatetic salesman problems.
Optimization 22 (1991), no. 1, 113-122. ...
For K = 2, especially for moderate-sized
Euclidean problems, the lower bound is superior to those obtained
by the traveling salesman problem and the assignment relaxation. B. ...
The k-dissimilar vehicle routing problem
2015
European Journal of Operational Research
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.
routing problem. 1 Assuming that a similarity metric can be calculated between any pair of alternative solutions, a feasible solution to the kd-VRP is a set of k feasible alternative solutions for which ...
In this paper we de ne a new problem, the aim of which is to nd a set of k dissimilar alternative solutions for a vehicle routing problem (VRP) on a single instance. is problem has several practical applications ...
Recently a problem similar to the m-PSP has been proposed within a competition (Kaggle, 2012) in which a peripatetic travelling salesman problem needs to be solved to help Santa Claus deliver his presents ...
doi:10.1016/j.ejor.2015.01.019
fatcat:75lt2wgdxrfj5o6r5v2er2i334
A concise guide to existing and emerging vehicle routing problem variants
[article]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The diversity of applications has motivated the study of a myriad of problem variants with different attributes. ...
In this article, we provide a concise overview of existing and emerging problem variants. ...
Thanks are also due to the referees for their valuable comments. ...
arXiv:1906.06750v2
fatcat:hlz5f3uv3fcptbhpljzyj6b6bm
Approximating the metric 2-Peripatetic Salesman Problem
2010
Algorithmic Operations Research
unpublished
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 2016; you can also visit the original URL.
The file type is application/pdf.
This paper deals with the 2-Peripatetic Salesman Problem for the case where costs respect the triangle inequality. ...
We first present a straightforward 9/4 approximation algorithm based on the well known Christofides algorithm for the travelling salesman problem. ...
Here we derive a 15 8 -approximation algorithm for the 2 − P SP , provided that a 5 4 approximation ratio is available for the related HC − ST problem. Consider the following algorithm. ...
fatcat:bmre55qearhfdme4eet4uaqa3i
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
[article]
2022
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.
Krarup posed the problem of finding $k$ edge-disjoint Hamiltonian Circuits of minimum total weight, called the peripatetic salesman problem (PSP). ...
Formally, given an integer $k$, an approximation factor $c$, and an instance $I$ of an optimization problem, we aim to obtain a set of $k$ solutions to $I$ that a) are all $c$ approximately-optimal for ...
This will result in a (2, c) approximation algorithm for the diversity computational problem. ...
doi:10.48550/arxiv.2202.10028
fatcat:hkz556535fel3pkafj6j5ahzmi
CPIDM: A Clustering-Based Profound Iterating Deep Learning Model for HSI Segmentation
2021
Wireless Communications and Mobile Computing
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.
comprehending the assessment of eminent conventional segmentation methodologies for HSI. ...
techniques based on the method of the clustering-based profound iterating deep learning model for HSI segmentation termed as CPIDM. ...
The occurrence of ANNs is essentially encouraged by the anticipation engendered by the Hopfield complex's capability to explore the peripatetic salesman delinquency and the reawakening of the back proliferation ...
doi:10.1155/2021/7279260
fatcat:d6dbtopkmnbzbed7w2o3sfubrq
Roles and Responsibilities
[chapter]
2016
Making It in IT
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.
Internal metrics for operational people within an organization and these can be quite detailed and used for operational and also for capacity planning purposes. 2. ...
The "2" eventually became a "3" in the 1970s, for example, 3330 disks. † A topic discussed in the Appendices. ...
Integrated ecosystems But in Gartner's "Top 10 Strategic Technology Trends for 2016," we find the following: 1. The device mesh 2. Ambient user experience 3. 3D-printing materials 4. ...
doi:10.1201/9781315366784-14
fatcat:hiiq2jrcsjeh3o4ftsf3dfob44
Behavioral and Social Science: Fifty Years of Discovery
1986
Contemporary Sociology
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.
Each of the 10 thematic chapters is a vivid portrait of newly gained knowledge, taken from a particular perspective; as a whole, the volume is a selective sampling from the gallery of behavioral and social ...
Symbolizing this interest, the papers in this volume were presented first at a commemorative public symposium held November 29-30,1983, marking the fiftieth anniversary of the publication of Recent Social ...
to verify that options C and D in Problem 2 are undistingu;shable in real terms from options A and B in Problem 1, respectively. ...
doi:10.2307/2071061
fatcat:eaaplogpnnhwddnbditxrovcs4
Working at Risk: An ethnography of making markets in Chicago
2008
unpublished
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.
This dissertation examines the role of market makers in making markets for options and futures on Chicago's derivatives exchanges. ...
The first challenge is that of maintaining behavioral standards within a market. The second challenge is that of mastering the skills required to manage risk. ...
If his costs are $1/bu, and he buys a contract for $2/bu, and when he sells, the crop sells for $3/bu and the futures sell for $4/bu, he makes $2/bu on the crop, and $2/bu on the futures. ...
doi:10.21985/n2bf03
fatcat:6xkx3ntvqvglrptevthelkgoja
LANGUAGE IN INDIA Strength for Today and Bright Hope for Tomorrow
unpublished
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 2018; you can also visit the original URL.
The file type is application/pdf.
The story begins with a travelling salesman, Gregor Samsa, waking to find himself transformed into a monstrous vermin. ...
Kolatkar"s peripatetic poems characterize the teenagers to be more curious. ...
Douglas provides a way to all the problems in life. ...
fatcat:n7j53czhcbhftndfvyxamawxxu