Minisum and maximin aerial surveillance over disjoint rectangles (Q518456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6697783 / rank
 
Normal rank
Property / zbMATH Keywords
 
travelling salesman problem
Property / zbMATH Keywords: travelling salesman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
planning
Property / zbMATH Keywords: planning / rank
 
Normal rank
Property / zbMATH Keywords
 
military
Property / zbMATH Keywords: military / rank
 
Normal rank
Property / zbMATH Keywords
 
search
Property / zbMATH Keywords: search / rank
 
Normal rank

Revision as of 04:45, 1 July 2023

scientific article
Language Label Description Also known as
English
Minisum and maximin aerial surveillance over disjoint rectangles
scientific article

    Statements

    Minisum and maximin aerial surveillance over disjoint rectangles (English)
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    travelling salesman problem
    0 references
    integer programming
    0 references
    planning
    0 references
    military
    0 references
    search
    0 references

    Identifiers