A Lagrangian Algorithm for Multiple Depot Traveling Salesman Problem With Revisit Period Constraints-Reference-Cited by-同舟云学术

A Lagrangian Algorithm for Multiple Depot Traveling Salesman Problem With Revisit Period Constraints

Author:

Scott Drew¹^ORCID,Manyam Satyanarayana Gupta²^ORCID,Casbeer David W.³^ORCID,Kumar Manish¹

Affiliation:

1. Department of Mechanical and Materials Engineering, University of Cincinnati, Cincinnati, OH, USA

2. Infoscitex Corporation, Dayton, OH, USA

3. Control Science Center of Excellence, U.S. Air Force Research Laboratory, Wright-Patterson Air Force Base, OH, USA

Funder

Ohio Department of Higher Education

Southwestern Council for Higher Education under Ohio House Bill 49 of the 132nd General Assembly

Air Force Office of Scientific Research Laboratory Research Initiation Request

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Control and Systems Engineering

Link

Reference42 articles.

4. Informational complexity and efficient methods for the solution of convex extremal problems;yudin;Matekon,1976

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献