Search & Read at all times.
Your portable library is online!,Hello!
Search Symbol (Half-width) Description of Search Symbols
Space "AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " ) Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" : " image process "
? Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
* Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )

Boolean logic combinations of key words is a skill used to expand or refine search parameters.
(1) AND (1) AND: Refines search parameters
(2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters


DOI stands for Digital Object Identifier ( D igital O bject I dentifier ) ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「」 「 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: 10.5297/ser.1201.002
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI ) 。

Previous Page
Next Page
There is no full-text available at the moment. Airiti would like to request author's authorization. I would like to provide authorization.
Abstract 〈TOP〉
Parallel Abstract 〈TOP〉
Reference ( 25 ) 〈TOP〉
  1. 2. Bansal, N., A. Blum, S. Chawla, and A. Meyerson. “Approximation algorithms for deadline-TSP and vehicle routing with time-windows.” Proceedings of the 36th ACM Symposium on Theory of Computing (STOC’04), 166-174 (2004).
  2. 5. Campbell, A.M., M. Gendreau, and B.W. Thomas. “The orienteering problem with stochastic travel and service times.” Annals of Operations Research, 186(1), 61-81(2011).
  3. 6. Chang, M.-S. “Efficient algorithms for the domination problems on interval and circular-arc graphs.” SIAM J. Computing, 27(6), 1671-1694 (1998).
  4. 7. Christofides, N. “Worst-case analysis of a new heuristic for the traveling salesman problem.” Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976).
  5. 9. Dijkstra, E.W. “A note on two problems in connexion with graphs.” Numerische Mathematik, 1(1)269-271 (1959).
Altmetrics 〈TOP〉
E-mail :
When an article is available to download, a notice will be sent to your mailbox address.
E-mail :