subproblem
noun Date: 1906 a problem that is contingent on or forms a part of another more inclusive problem

New Collegiate Dictionary. 2001.

### Look at other dictionaries:

• subproblem — n. * * * …   Universalium

• subproblem — noun A problem the solution of which contributes to the solution of larger problem …   Wiktionary

• subproblem — sub·problem …   English syllables

• subproblem — “+ noun Etymology: sub + problem : a problem that is contingent on or forms a part of another more inclusive problem * * * n …   Useful english dictionary

• Overlapping subproblem — In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times.For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems …   Wikipedia

• Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

• Delayed column generation — is an efficient algorithm for solving larger linear programs.The overarching idea is that many linear programs are too large to consider all the variables explicitly. Since most of the variables will be non basic and assume a value of zero in the …   Wikipedia

• Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

• Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… …   Wikipedia

• Delayed column-generation — is an efficient algorithm for solving larger linear programs. The overarching idea is that many linear programs are too large to consider all the variables explicitly. Since most of the variables will be non basic and assume a value of zero in… …   Wikipedia