Route optimization for multiple searchers (Q3065632): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Bonmin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.20432 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984142532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search for a Moving Target in Discrete Time and Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using multiple searchers in constrained-path, moving-target search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path optimization for the resource-constrained searcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving convex MINLP optimization problems using a sequential cutting plane algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound methods for a search problem / rank
 
Normal rank

Revision as of 14:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Route optimization for multiple searchers
scientific article

    Statements

    Route optimization for multiple searchers (English)
    0 references
    0 references
    0 references
    6 January 2011
    0 references
    military operations research
    0 references
    search and surveillance
    0 references
    route planning
    0 references
    mixed-integer nonlinear programing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references