Regional surveillance of disjoint rectangles: a travelling salesman formulation

DOI10.1057/palgrave.jors.2602507zbMath1168.90633OpenAlexW1992449601MaRDI QIDQ3394064

N. G. F. Sancho, K. Y. K. Ng

Publication date: 28 August 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602507

zbMATH Keywords

dynamic programmingtravelling salesman problemmilitary applications

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (2)

Minisum and maximin aerial surveillance over disjoint rectangles ⋮ A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem

This page was built for publication: Regional surveillance of disjoint rectangles: a travelling salesman formulation