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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.20432
@@ Property / full work available at URL: https://doi.org/10.1002/nav.20432 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1984142532
@@ Property / OpenAlex ID: W1984142532 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing a class of submodular utility functions
+Normal rank
@@ Property / cites work @@
+Q3358515
@@ Property / cites work: Q3358515 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for convex mixed integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+Optimal Search for a Moving Target in Discrete Time and Space
+Normal rank
@@ Property / cites work @@
+Using multiple searchers in constrained-path, moving-target search problems
+Normal rank
@@ Property / cites work @@
+An outer-approximation algorithm for a class of mixed-integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
+Normal rank
@@ Property / cites work @@
+The Cutting-Plane Method for Solving Convex Programs
+Normal rank
@@ Property / cites work @@
+Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
+Normal rank
@@ Property / cites work @@
+Path optimization for the resource-constrained searcher
+Normal rank
@@ Property / cites work @@
+Q4197609
@@ Property / cites work: Q4197609 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving convex MINLP optimization problems using a sequential cutting plane algorithm
+Normal rank
@@ Property / cites work @@
+Q4256462
@@ Property / cites work: Q4256462 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and bound methods for a search problem
@@ Property / cites work: Branch and bound methods for a search problem / rank @@
+Normal rank