Covering Salesman Problem with Nodes and Segments

Journals Menu

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

ISSN Print: 2160-8830
ISSN Online: 2160-8849
www.scirp.org/journal/ajor
E-mail: ajor@scirp.org

Google-based Impact Factor: 1.72
Citations

Journals Menu

"Covering Salesman Problem with Nodes and Segments"
written by Takafumi Matsuura, Takayuki Kimura,
published by American Journal of Operations Research, Vol.7 No.4, 2017

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	A Study on Robot and Drone Assisted Delivery Problems and Their Solutions
	2024

[2]	Last mile delivery routing problem using autonomous electric vehicles
	Computers & Industrial Engineering, 2023

[3]	Drone-Assisted Last-Mile Delivery Problem by Covering Salesman Problem with Nodes and Segments
	SSRN Electronic Journal, 2022

[4]	Coverage Path Planning for Seabed Mapping using Autonomous Surface Vehicles
	2019

[5]	An Energy Efficient Tour Construction Using Restricted k-Means Clustering Algorithm for Mobile Sink in Wireless Sensor Networks
	2018

[1]	Set Covering Routing Problems: A review and classification scheme Computers & Industrial Engineering, 2024 DOI:10.1016/j.cie.2024.110730

[2]	Drone-Assisted Last-Mile Delivery Problem by Covering Salesman Problem with Nodes and Segments SSRN Electronic Journal , 2022 DOI:10.2139/ssrn.4167190

[3]	An Energy Efficient Tour Construction Using Restricted k-Means Clustering Algorithm for Mobile Sink in Wireless Sensor Networks 2018 11th International Conference on Developments in eSystems Engineering (DeSE), 2018 DOI:10.1109/DeSE.2018.00022

Follow SCIRP

	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

American Journal of Operations Research

Journals Menu

Home

About SCIRP

Service

Policies