Generalizations in the linear search problem
From MaRDI portal
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
- scientific article; zbMATH DE number 3425889 (Why is no real title available?)
- Analytic Inequalities
- More on the linear search problem
- On the linear search problem
- Son of the linear search problem
- The Revenge of the Linear Search Problem
- The linear search problem rides again
- The return of the linear search problem
- Yet more on the linear search problem
Cited in
(11)- Search and delivery man problems: when are depth-first paths optimal?
- The Chinese deliveryman problem
- Hide-and-seek games on a tree to which Eulerian networks are attached
- scientific article; zbMATH DE number 4047207 (Why is no real title available?)
- scientific article; zbMATH DE number 1524187 (Why is no real title available?)
- scientific article; zbMATH DE number 4083352 (Why is no real title available?)
- On linear search heuristics
- A general framework for searching on a line
- The Revenge of the Linear Search Problem
- scientific article; zbMATH DE number 500313 (Why is no real title available?)
- General methods for adding range restrictions to decomposable searching problems
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)
