A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations

DOI10.3138/infor.49.1.015OpenAlexW2139177468MaRDI QIDQ6102714

Luc Lamontagne, Irène Abi-Zeid, Unnamed Author

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.49.1.015

zbMATH Keywords

resource allocationsearch theoryconstraint programmingsearch and rescuemultiple rectangular search areas

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Static target search path planning optimization with heterogeneous agents ⋮ A dynamic multi-objective location-allocation model for search and rescue assets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SARPlan: A decision support system for Canadian search and rescue operations
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Constraint satisfaction problems: Algorithms and applications
• Constraint and integer programming. Toward a unified methodology.
• Constraint programming for combinatorial search problems
• Using multiple searchers in constrained-path, moving-target search problems

This page was built for publication: A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations