Search references for LINEAR SEARCH-PROBLEM. Phrases containing LINEAR SEARCH-PROBLEM
See searches and references containing LINEAR SEARCH-PROBLEM!LINEAR SEARCH-PROBLEM
Sequentially looking in an array
In computer science, linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list
Linear_search
Computational search problem
In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered
Linear_search_problem
Any algorithm which solves the search problem
In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within
Search_algorithm
Mathematical optimization problem restricted to integers
decision variables are not discrete, the problem is known as a mixed-integer programming problem. Integer linear programs can be expressed either in canonical
Integer_programming
Method to solve optimization problems
has the largest (or smallest) value if such a point exists. Linear programs are problems that can be expressed in standard form as: Find a vectorđ±that
Linear_programming
Optimization problem in computer science
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most
Nearest_neighbor_search
Search algorithm used in sorted arrays
Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are
Binary_search
American mathematician (1920â1984)
an associated cost function. Classical variational problems, for example, the brachistochrone problem can be solved using this method as well. The equation
Richard_Bellman
Mathematical optimization problem
minimum cost flow problem can be solved by linear programming, since we optimize a linear function, and all constraints are linear. Apart from that, many
Minimum-cost_flow_problem
Metaheuristic method for optimization problems
optimization problems and according to these, it is aimed for solving linear program problems, integer program problems, mixed integer program problems, nonlinear
Variable_neighborhood_search
Search problem
on it, MIPS search can be defined as the problem of determining argmaxiâSÂ âšxi,qâ© for a given query q. Although there is an obvious linear-time implementation
Maximum_inner-product_search
Subfield of mathematical optimization
unconstrained problems, or the problems with only equality constraints. As the equality constraints are all linear, they can be eliminated with linear algebra
Convex_optimization
Estimate of time taken for running an algorithm
sub-linear time. There are some problems for which we know quasi-polynomial time algorithms, but no polynomial time algorithm is known. Such problems arise
Time_complexity
Algorithm that begins on possibly incomplete inputs
scheduling problem List update problem Bandit problem Secretary problem Search games Ski rental problem Linear search problem Portfolio selection problem Paging
Online_algorithm
Classical problem in combinatorics
receives the coverage it requires. The set cover problem can be formulated as the following integer linear program (ILP). For a more compact representation
Set_cover_problem
Polynomial equation whose integer solutions are sought
beyond the case of linear and quadratic equations, was an achievement of the twentieth century. However, Hilbert's tenth problem shows that there cannot
Diophantine_equation
solves the linear programming problem in polynomial time. Simplex algorithm: an algorithm for solving linear programming problems Local search: a metaheuristic
List_of_algorithms
Problem-solving technique and algorithmic paradigm
computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic
Brute-force_search
NP-hard problem in combinatorial optimization
Selmer M. Johnson from the RAND Corporation, who expressed the problem as an integer linear program and developed the cutting plane method for its solution
Travelling_salesman_problem
Problem of determining if a Boolean formula could be made true
normal form formula with length linear in the size of the original propositional logic formula. SAT was the first problem known to be NP-complete, as proved
Boolean satisfiability problem
Boolean_satisfiability_problem
Optimization method
Prune and search is a method of solving optimization problems suggested by Nimrod Megiddo in 1983. The basic idea of the method is a recursive procedure
Prune_and_search
Search problem in quantum mechanics
The hidden linear function problem, is a search problem that generalizes the BernsteinâVazirani problem. In the BernsteinâVazirani problem, the hidden
Hidden linear function problem
Hidden_linear_function_problem
Subfield of mathematical optimization
(uses linear optimisation to generate bounds), dynamic programming (a recursive solution construction with limited search window) and tabu search (a greedy-type
Combinatorial_optimization
Study of mathematical algorithms for optimization problems
optimization problem or a mathematical programming problem (a term not directly related to computer programming, but still in use for example in linear programming
Mathematical_optimization
Algorithm for linear programming
process to distract him from taking another job. Dantzig formulated the problem as linear inequalities inspired by the work of Wassily Leontief, however at
Simplex_algorithm
Inventory control problem Newsvendor model Extended newsvendor model Assemble-to-order system Linear programming decoding Linear search problem â find a point
List of numerical analysis topics
List_of_numerical_analysis_topics
Rooted binary tree data structure
operations on the binary search tree is linear with respect to the height of the tree. Binary search trees allow binary search for fast lookup, addition
Binary_search_tree
problem List update problem Bandit problem Secretary problem Search games Ski rental problem Linear search problem Portfolio selection problem Online matching
Online_optimization
Solving an optimization problem with a quadratic objective function
the solution to the equality constrained problem Minimize12đ±TQđ±+đTđ± subject toEđ±=đ is given by the linear system [QEâ€E0][đ±Î»]=[âđđ] where λ is a
Quadratic_programming
List of unsolved computational problems
NP? NC = P problem NP = co-NP problem P = BPP problem P = PSPACE problem L = NL problem PH = PSPACE problem L = P problem L = RL problem Unique games
List of unsolved problems in computer science
List_of_unsolved_problems_in_computer_science
Solution process for some optimization problems
optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. An optimization problem is one
Nonlinear_programming
Computer programming method for hashing
cell of the hash table that is already occupied by another key, linear probing searches the table for the closest following free location and inserts the
Linear_probing
Concept in integral mathematics
In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable
Linear_programming_relaxation
Problem in combinatorial optimization
Lipton, Richard J. (1978). "A lower bound of œn2 on linear search programs for the Knapsack problem". Journal of Computer and System Sciences. 16 (3):
Knapsack_problem
Quantum algorithm framework
quantum algorithms for problems that can be solved with linear algebra, including Hamiltonian simulation, search problems, and linear system solving. It was
Quantum singular value transformation
Quantum_singular_value_transformation
Problem of finding the longest simple path for a given graph
it has a linear time solution for directed acyclic graphs, which has important applications in finding the critical path in scheduling problems. The NP-hardness
Longest_path_problem
Optimizing objective functions that have constrained variables
then the problem is a linear programming problem. This can be solved by the simplex method, which usually works in polynomial time in the problem size but
Constrained_optimization
Search engine from Google
Google Search (also known simply as Google) is a search engine operated by Google. Launched in 1998 as the company's inaugural product and mostly developed
Google_Search
Application of metaheuristic search techniques to software engineering
operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational
Search-based software engineering
Search-based_software_engineering
Mathematical optimization algorithm
the final result of optimization. For example, in solving the linear programming problem, the active set gives the hyperplanes that intersect at the solution
Active-set_method
Computational problem of graph theory
single-source problem if edge weights may be negative. A* search algorithm solves for single-pair shortest path using heuristics to try to speed up the search. FloydâWarshall
Shortest_path_problem
Generalization of linear programming
LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties with low-dimensional linear programs
LP-type_problem
Optimization algorithm
solutions (the search space). Examples of algorithms that solve convex problems by hill-climbing include the simplex algorithm for linear programming and
Hill_climbing
Algorithm in graph theory
problem. The network simplex method works very well in practice, typically 200 to 300 times faster than the simplex method applied to general linear program
Network_simplex_algorithm
Finding the smallest circle that contains all given points
problem in the plane, and the smallest bounding sphere problem in any higher-dimensional space of bounded dimension are solvable in worst-case linear
Smallest-circle_problem
American mathematician
dynamics, Probability in Banach spaces, measure theory, search theory, linear search problem, and mathematics in the social sciences. Beck was an ardent
Anatole_Beck
Initial set of valid possible values
pure integer programming problems, the feasible set is the set of integers (or some subset thereof). In linear programming problems, the feasible set is a
Feasible_region
Decision problem in computer science
in 1999, Pisinger found a linear time algorithm having time complexity O(NC) (note that this is for the version of the problem where the target sum is not
Subset_sum_problem
Optimization algorithm
a similar method in 1907. Its convergence properties for non-linear optimization problems were first studied by Haskell Curry in 1944, with the method
Gradient_descent
Optimization problem
of sets to choose from. The problem can then be modelled using a linear programming model for the weighted set cover problem, with the weight of a route
Vehicle_routing_problem
Optimization technique for solving (mixed) integer linear programs
of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as
Cutting-plane_method
Software for a class of mathematical problems
easily be applied to other problems of similar type. Types of problems with existing dedicated solvers include: Linear and non-linear equations. In the case
Solver
Seven mathematical problems with a US$1 million prize for each solution
is a linear combination with rational coefficients of the cohomology classes of complex subvarieties of X. The official statement of the problem was given
Millennium_Prize_Problems
system, there exist nonlinear control laws that outperform all linear laws. The problem of finding the optimal control law remains unsolved. The statement
Witsenhausen's_counterexample
Computational geometry problem
complexity of geometric algorithms. Randomized algorithms that solve the problem in linear time are known, in Euclidean spaces whose dimension is treated as
Closest pair of points problem
Closest_pair_of_points_problem
Optimization by removing non-optimal solutions to subproblems
nodes of the search tree, as well as a problem-specific branching rule. Using a heuristic, find a solution xh to the optimization problem. Store its value
Branch_and_bound
Finite sequence of instructions
Turing with terms such as "memory", "search" and "stimulus". In contrast, a heuristic is an approach to problem-solving that may not be fully specified
Algorithm
Two-person zero-sum game
over the whole trajectory space. This tool has been used for the linear search problem, i.e., finding a target on the infinite line, which has attracted
Search_game
Task of computing complete subgraphs
significantly less than linear. The clique decision problem is NP-complete. It was one of Richard Karp's original 21 problems shown NP-complete in his
Clique_problem
Mathematical concept
the formulation. Their approach used a Mixed-Integer Linear Program to solve the optimization problem for a weighted sum of the two objectives to calculate
Multi-objective_optimization
Subset of a graph's vertices, including at least one endpoint of every edge
cover problem can be formulated as a half-integral, linear program whose dual linear program is the maximum matching problem. Vertex cover problems have
Vertex_cover
Algorithms for solving convex optimization problems
barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs combine two advantages of previously-known algorithms:
Interior-point_method
List of quantum computing algorithms
including algorithms, algorithmic techniques, computational models, and problem frameworks used in quantum computing. A quantum algorithm is an algorithm
List_of_quantum_algorithms
Set of objects whose state must satisfy limits
solve problems of many seemingly unrelated families. CSPs often exhibit high complexity, requiring a combination of heuristics and combinatorial search methods
Constraint satisfaction problem
Constraint_satisfaction_problem
Optimization algorithm
implicitly. Due to its resulting linear memory requirement, the L-BFGS method is particularly well suited for optimization problems with many variables. Instead
Limited-memory_BFGS
Method of solving linear programming problems
method of solving linear programming problems using the simplex algorithm. The Big M method extends the simplex algorithm to problems that contain "greater-than"
Big_M_method
Combinatorial optimization method
combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are restricted
Branch_and_cut
Minimum relevant variables in linear system (Min-RVLS) is a problem in mathematical optimization. Given a linear program, it is required to find a feasible
Minimum relevant variables in linear system
Minimum_relevant_variables_in_linear_system
Computational problem in graph theory
published an almost-linear time algorithm running in O(|E|1+o(1)) for the minimum-cost flow problem of which the maximum flow problem is a particular case
Maximum_flow_problem
Problem of finding a cycle through all vertices of a graph
Chiba, Norishige; Nishizeki, Takao (1989), "The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs", Journal of Algorithms
Hamiltonian_path_problem
Logical problem studied in computer science
express constraints such as linear arithmetic or difference logicâanswer set programming is best suited to Boolean problems that reduce to the free theory
Satisfiability modulo theories
Satisfiability_modulo_theories
Problem optimization method
simplifying a complex problem by breaking it down into simpler subproblems in a recursive manner. While some decision problems cannot be taken apart this
Dynamic_programming
Unsolved problem in computer science
Unsolved problem in computer science If the solution to a problem can be verified in polynomial time, must the problem be solvable in polynomial time
P_versus_NP_problem
Optimization algorithm
proposed and work on the traveling salesman problem. The pheromone deposit mechanism of COAC is to enable ants to search for solutions collaboratively and effectively
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Local search algorithm
1986 and formalized in 1989. Local (neighborhood) searches take a potential solution to a problem and check its immediate neighbors (that is, solutions
Tabu_search
Interdisciplinary research discipline
advances in computational economics include search and matching theory, game theory, the theory of linear programming, algorithmic mechanism design, and
Computational_economics
Algorithm for solving linear programming problems with special structure
DantzigâWolfe decomposition is an algorithm for solving (mixed integer) linear programming problems by exploiting their structure. It was originally developed by
DantzigâWolfe_decomposition
Mathematical problem in cryptography
computational problem of inferring a linear n-ary function f over a finite ring from given samples yi=f(đ±i) some of which may be erroneous. The LWE problem is conjectured
Learning_with_errors
Machine learning and applied statistics
numerical solutions for integration, linear algebra, optimization and simulation and differential equations are seen as problems of statistical, probabilistic
Probabilistic_numerics
Algorithm used to solve non-linear least squares problems
least-squares (DLS) method, is used to solve non-linear least squares problems. These minimization problems arise especially in least squares curve fitting
LevenbergâMarquardt algorithm
LevenbergâMarquardt_algorithm
Classification of algorithm
(though not provably optimal) solutions to complex optimization problems. The expected linear time MST algorithm is able to discover the minimum spanning
Galactic_algorithm
Path-finding using high-weight graph edges
and search for any path among the remaining edges using breadth-first search or depth-first search. Based on this test, there also exists a linear time
Widest_path_problem
Partition of a graph whose components are reachable from all vertices
on depth-first search compute strongly connected components in linear time. Kosaraju's algorithm uses two passes of depth-first search. The first, in
Strongly_connected_component
Computer programming paradigm
apply (SAT problem) integer domains, rational domains interval domains, in particular for scheduling problems linear domains, where only linear functions
Constraint_programming
homomorphisms Anatole Beck (B.A. 1951), mathematician, known for his linear search problem Richard Bellman (B.A. 1941), applied mathematician and inventor
List of Brooklyn College alumni
List_of_Brooklyn_College_alumni
Algorithm for solving linear programs
large linear programs that would otherwise be intractable. The classical example of a problem where it is successfully used is the cutting stock problem. One
Column_generation
Subfield of convex optimization
terms of semidefinite programs. A linear programming problem is one in which we wish to maximize or minimize a linear objective function of real variables
Semidefinite_programming
System of resource-aware logic
lies behind the applications of linear logic in computer science, since it allows the logic to be used in proof search and as a resource-aware lambda-calculus
Linear_logic
Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are
Sequential linear-quadratic programming
Sequential_linear-quadratic_programming
Physics problem related to laws of motion and gravity
were linearly unstable. In 2026 Hristov, Hristova and Tanikawa established four regions of stability for the equal-mass zero-angular-momentum problem and
Three-body_problem
Syllabic script used for writing Mycenaean Greek
contains Linear B Unicode characters. Without proper rendering support, you may see question marks, boxes, or other symbols instead of Linear B. Linear B is
Linear_B
Mathematical combinatorial optimization method
combinatorial optimization for solving integer linear programming (ILP) and mixed integer linear programming (MILP) problems with many variables. The method is a
Branch_and_price
functions; linear, sparse linear, nonlinear, bounded or no constraints; local and global optimizations; continuous or integer problems. NMath â linear, quadratic
List_of_optimization_software
Iterative method for minimizing convex functions
minimizer of a convex function. When specialized to solving feasible linear optimization problems with rational data, the ellipsoid method is an algorithm which
Ellipsoid_method
Optimization algorithm
optimizes a quadratic model of the objective subject to a linearization of the constraints. If the problem is unconstrained, then the method reduces to Newton's
Sequential quadratic programming
Sequential_quadratic_programming
Node ordering for directed acyclic graphs
and there are linear time algorithms for constructing it. Topological sorting has many applications, especially in ranking problems such as feedback
Topological_sorting
Set of methods for supervised statistical learning
Whereas the original problem may be stated in a finite-dimensional space, it often happens that the sets to discriminate are not linearly separable in that
Support_vector_machine
Numerical optimization method
Random search (RS) is a family of numerical optimization methods that do not require the gradient of the optimization problem, and RS can hence be used
Random_search
Mathematical and computational problem
variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on. The bin packing problem can also be seen
Bin_packing_problem
String-searching algorithm
simultaneously. The complexity of the algorithm is linear in the length of the strings plus the length of the searched text plus the number of output matches. Because
AhoâCorasick_algorithm
travel, tourism, insurance
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
LINEAR SEARCH-PROBLEM
travel, tourism, insurance