Search Results - subject:"Search problems"

Exact and approximation algorithms for the expanding search problem

Hermans, Ben; Leus, Roel; Matuschke, Jannik - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 1, pp. 281-296

Persistent link: https://www.econbiz.de/10013358961

Approximations to stochastic dynamic programs via information relaxation duality

Balseiro, Santiago R.; Brown, David B. - In: Operations research 67 (2019) 2, pp. 577-597

Persistent link: https://www.econbiz.de/10012022386

A hybrid method for the modelling and optimisation of constrained search problems

Sitek, Pawel; Wikarek, Jaroslaw - In: Foundations of Management 5 (2013) 3, pp. 7-22

The paper presents a concept and the outline of the implementation of a hybrid approach to modelling and solving constrained problems. Two environments of mathematical programming (in particular, integer programming) and declarative programming (in particular, constraint logic programming) were...

Persistent link: https://www.econbiz.de/10011923088

A hybrid method for the modelling and optimisation of constrained search problems

Sitek, Pawel; Wikarek, Jaroslaw - In: Foundations of Management : the journal of Warsaw … 5 (2013) 3, pp. 7-22

Persistent link: https://www.econbiz.de/10011855203

Optimal search and ambush for a hider who can escape the search region

Alpern, Steve; Fokkink, Robbert; Simonjuntak, Martin - In: European journal of operational research : EJOR 251 (2016) 3, pp. 707-714

Persistent link: https://www.econbiz.de/10011448937

Heuristic estimates in shortest path algorithms

Pijls, Pijls, W.H.L.M. - Faculteit der Economische Wetenschappen, Erasmus … - 2006

Shortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application...

Persistent link: https://www.econbiz.de/10010731678

Heuristic estimates in shortest path algorithms

Pijls, W.H.L.M. - Erasmus University Rotterdam, Econometric Institute - 2006

theory, Operations Research, Search problems. ⁄Econometric Institute, Erasmus University Rotterdam, P.O.Box 1738, 3000 DR …) addresses search problems involving heuristics estimates. The related algorithms can be viewed as shortest paths algorithms … availability of a so-called heuristic estimate. A heuristic estimate h is deflned as a function from V intoR. Many search problems …

Persistent link: https://www.econbiz.de/10004991088

MANHUNTING — A SIMPLE SEARCH GAME

MCCORMICK, GORDON H.; OWEN, GUILLERMO - In: International Game Theory Review (IGTR) 12 (2010) 04, pp. 293-308

We consider a search game in which a hider chooses to hide in any one of many cells. A searcher looks in any of the cells. The probability of finding the hider depends (a) on the characteristics of the cell, and (b) on whether the searcher looks in the right cell. It is possible that the hider...

Persistent link: https://www.econbiz.de/10009018938