Minisum and maximin aerial surveillance over disjoint rectangles

DOI10.1007/S11750-016-0416-1zbMath1362.90325OpenAlexW2343827397MaRDI QIDQ518456

Orhan Karasakal

Publication date: 28 March 2017

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/36889

zbMATH Keywords

integer programmingtravelling salesman problemplanningsearchmilitary

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Uses Software

• GAMS

Cites Work

• A min-max vehicle routing problem with split delivery and heterogeneous demand
• The orienteering problem: a survey
• A hierarchical approach for planning a multisensor multizone search for a moving target
• Mission planning for regional surveillance
• Optimal search strategies using simultaneous generalized hill climbing algorithms
• Routing of platforms in a maritime surface surveillance operation
• Improved algorithms for orienteering and related problems
• Integer Programming Formulation of Traveling Salesman Problems
• Regional surveillance of disjoint rectangles: a travelling salesman formulation
• Generalized orienteering problem with resource dependent rewards
• An automated surface surveillance system
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Minisum and maximin aerial surveillance over disjoint rectangles