stands for Digital Object Identifier
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「http://dx.doi.org/」
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: http://dx.doi.org/ 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 Registration （ doi.airiti.com ） 。
- 1. Armentano, V. A. and J. C. Arroyo, “An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem,” Journal of Heuristics, 10, pp.463-481, 2004.
- 3. Buriol, L., P.Franca, and P.Moscato., “A new memetic algorithm for the asymmetric traveling salesman problem,” Journal of Heuristics, 10(5):483-506, 2004
- 4. Chang, P. C., J.C. Hsieh and S.G. Lin, “The Development of Gradual Priority Weighting Approach for the Multi-Objective Flow shop Scheduling Problem,” International Journal of Production Economics, 79(3), pp.171-183, 2002.
- 5. Chang, P. C., Y. W. Wang and C. H. Liu, “New Operators for Faster Convergence and Better Solution Quality in Modified Genetic Algorithm,” Lecture Notes in Computer Science, 3611, pp.983-991, 2005.
- 6. Chang, P. C., S. H. Chen and J. C. Hsieh, “A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-Objective Parallel-Machine Scheduling Problem,” accepted by Lecture Notes in Computer Science, 2006.
The cart has had several articles, so do you want to clear it, or add together to the cart?