Rakabog
Joined 7 February 2012
Latest comment: 2 months ago by Suitskvarts in topic Your submission at Articles for creation: Fixed set search (August 29)
| This is Rakabog's talk page, where you can send them messages and comments. |
|
Your submission at Articles for creation: Fixed set search (April 24)
edit
- If you would like to continue working on the submission, go to Draft:Fixed set search and click on the "Edit" tab at the top of the window.
- If you do not edit your draft in the next 6 months, it will be considered abandoned and may be deleted.
- If you need any assistance, or have experienced any untoward behavior associated with this submission, you can ask for help at the Articles for creation help desk, on the reviewer's talk page or use Wikipedia's real-time chat help from experienced editors.
|
Hello, Rakabog!
Having an article draft declined at Articles for Creation can be disappointing. If you are wondering why your article submission was declined, please post a question at the Articles for creation help desk. If you have any other questions about your editing experience, we'd love to help you at the Teahouse, a friendly space on Wikipedia where experienced editors lend a hand to help new editors like yourself! See you there! Shadow311 (talk) 00:28, 24 April 2024 (UTC)
|
- Dear Shadow311,
- I would like to ask for advice for avoiding the potential COI.
- The used references are published in prominent top tier scientific journals and books in applied mathematics and operations research ( Applied Soft Computing, Expert Systems, European Journal of Operational Research, Journal of Heuristics, OR Spectrum, Lecture Notes in Computer Science). These are all peer reviewed journals or book series. The proposed Wikipedia article summarizes the ideas of these papers.
- This is a method that I have developed with international collaborators from several different universities. Since this is a mathematical model I doubt that there can be a true conflict of interest. The validity and effectiveness of the proposed approach has been confirmed by reviewers of the mentioned journals.
- Since this is a new method, only a single paper has been published independently from the main developers of the method
- Lozano-Osorio, I., Sánchez-Oro, J., Martínez-Gavara, A., López-Sánchez, A.D., Duarte, A. (2023). An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_37
- I could add this reference. Would this be sufficient?
- The other option is to add additional reference that fit the method in the general field of metaheuristics.
- Is it simple not possible to submit an article on a method that I have developed myself?
- I would be very grateful for your advice. Rakabog (talk) 07:16, 7 May 2024 (UTC)
- I would also like to mention that articles for specific metaheuristics often have the same issue with citations. Some examples can be seen in the following Wikipedia articles
- Greedy randomized adaptive search procedure
- Bees algorithm
- Artificial bee colony algorithm Rakabog (talk) 07:26, 7 May 2024 (UTC)
Your submission at Articles for creation: Fixed set search (August 29)
edit - If you would like to continue working on the submission, go to Draft:Fixed set search and click on the "Edit" tab at the top of the window.
- If you do not edit your draft in the next 6 months, it will be considered abandoned and may be deleted.
- If you need any assistance, or have experienced any untoward behavior associated with this submission, you can ask for help at the Articles for creation help desk, on the reviewer's talk page or use Wikipedia's real-time chat help from experienced editors.