Corrections to “Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation”

In the above article <xref ref-type="bibr" rid="ref1">[1]</xref>, there were a few unclear statements in the original published version that need to be clarified. On page 5, in the first paragraph of the second column, the sentence &#x201C;Then, items with positiv...

Full description

Saved in:
Bibliographic Details
Main Authors: Zitong Zhang, Lei Yang, Peipei Kang, Xiaotian Jia, Wensheng Zhang
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Online Access:https://ieeexplore.ieee.org/document/10050194/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the above article <xref ref-type="bibr" rid="ref1">[1]</xref>, there were a few unclear statements in the original published version that need to be clarified. On page 5, in the first paragraph of the second column, the sentence &#x201C;Then, items with positive scores are considered to be selected (those with negative scores do not contribute to the total profit), and their average <inline-formula> <tex-math notation="LaTeX">$AVG_{score}$ </tex-math></inline-formula> and maximum <inline-formula> <tex-math notation="LaTeX">$MAX_{score}$ </tex-math></inline-formula> scores are calculated&#x201D; should be corrected to &#x201C;Then, items with positive scores are selected (not all items with positive scores are selected, those with negative scores do not contribute to the total profit), and their average <inline-formula> <tex-math notation="LaTeX">$AVG_{score}$ </tex-math></inline-formula> and maximum <inline-formula> <tex-math notation="LaTeX">$MAX_{score}$ </tex-math></inline-formula> scores are calculated.&#x201D;
ISSN:2169-3536