Search results
Results from the WOW.Com Content Network
Another related problem is the bottleneck travelling salesman problem: Find a Hamiltonian cycle in a weighted graph with the minimal weight of the weightiest edge. A real-world example is avoiding narrow streets with big buses. [15] The problem is of considerable practical importance, apart from evident transportation and logistics areas.
The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles. [1] Another classification of problem-solving tasks is into well-defined problems with specific obstacles and goals, and ill-defined problems in which the current situation is ...
The closest pair of points problem or closest pair problem is a problem of computational geometry: given points in metric space, find a pair of points with the smallest distance between them. The closest pair problem for points in the Euclidean plane [ 1 ] was among the first geometric problems that were treated at the origins of the systematic ...
Route inspection problem (also called Chinese postman problem) for mixed graphs (having both directed and undirected edges). The program is solvable in polynomial time if the graph has all undirected or all directed edges. Variants include the rural postman problem. [3]: ND25, ND27 Clique cover problem [2] [3]: GT17
One example is the constrained shortest path problem, [16] which attempts to minimize the total cost of the path while at the same time maintaining another metric below a given threshold. This makes the problem NP-complete (such problems are not believed to be efficiently solvable for large sets of data, see P = NP problem ).
Despite the many local maxima in this graph, the global maximum can still be found using simulated annealing. Unfortunately, the applicability of simulated annealing is problem-specific because it relies on finding lucky jumps that improve the position. In such extreme examples, hill climbing will most probably produce a local maximum.
The problem format and the structural type of analog presentation showed the highest positive transference to problem solving. The researcher suggested that a well-thought and planned analogy relevant in format and type to the problem-solving task to be completed can be helpful for students to overcome functional fixedness.
The situational theory of problem solving attempts to explain why and how an individual communicates during a problematic situation. The situational theory of problem solving (STOPS) was proposed by Jeong-Nam Kim and James E. Grunig in 2011 though their article “problem solving and communicative action: A situational theory of problem solving.”