The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For a lot of producers have never saved materials of their products for aims of economizing their time and saving costs, but when they have received orders, they will start from their locations with their production lines travel first to the material supply regions, second to the ordered regions, and product their products on the travelling time. Here, we consider their minimum travelling time routing...
In this paper, we consider the maximum traveling salesman problem with γ-parameterized triangle inequality for γ∈[12,1), which means that the edge weights in the given complete graph G=(V,E,w) satisfy w(uv)≤γ⋅(w(ux)+w(xv)) for all distinct nodes u,x,v∈V. For the maximum traveling salesman problem with γ-parameterized triangle inequality, R. Hassin and S. Rubinstein gave a constant factor approximation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.