Generalizations in the linear search problem
From MaRDI portal
Publication:1895083
DOI10.1007/BF02783218zbMATH Open0831.90078OpenAlexW2082019079MaRDI QIDQ1895083FDOQ1895083
Authors: Vic Baston, Anatole Beck 
Publication date: 18 January 1996
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02783218
Recommendations
- scientific article; zbMATH DE number 4083352
- THE GENERALIZED LINEAR SEARCH PROBLEM, EXISTENCE OF OPTIMAL SEARCH PATHS
- scientific article; zbMATH DE number 519598
- On linear search heuristics
- The Revenge of the Linear Search Problem
- A generalization of the integer linear infeasibility problem
- The linear search problem rides again
- scientific article; zbMATH DE number 1670671
- Generalized pattern search methods for linearly equality constrained optimization problems
Cites Work
- Analytic Inequalities
- Title not available (Why is that?)
- On the linear search problem
- Yet more on the linear search problem
- The linear search problem rides again
- Son of the linear search problem
- More on the linear search problem
- The return of the linear search problem
- The Revenge of the Linear Search Problem
Cited In (11)
- A general framework for searching on a line
- Title not available (Why is that?)
- On linear search heuristics
- Hide-and-seek games on a tree to which Eulerian networks are attached
- The Revenge of the Linear Search Problem
- Title not available (Why is that?)
- General methods for adding range restrictions to decomposable searching problems
- Title not available (Why is that?)
- Search and delivery man problems: when are depth-first paths optimal?
- Title not available (Why is that?)
- The Chinese deliveryman problem
This page was built for publication: Generalizations in the linear search problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895083)
