Sentence examples for the problem belonged from inspiring English sources
The phrase "the problem belonged" is correct and usable in written English.
It can be used when discussing ownership or association of a problem to a person, group, or situation. Example: "After reviewing the case, it became clear that the problem belonged to the previous management team."
The problem belonged to Dr. Wilkins at the University of London.
One said the problem belonged to the carrier whose name was on the policies when the workers were first exposed.
The problem belonged to Greg Govan, the veteran Byram Hills coach, himself a relay star on Villanova teams that twice won national championships.
Credit for solving the problem belongs principally to John Augustus Roebling, a German-born American engineer who added a web truss to either side of his roadways and produced a structure so rigid that he successfully bridged the Niagara Gorge at Niagara Falls, New York, the Ohio River at Cincinnati, and, finally, in his masterpiece, the East River between Brooklyn and Manhattan at New York City.
The problem belongs to a class of NP-complete ones.
In the case where nodes are used for the representation, the problem belongs to the class of the node routing problems; if arcs are used, then the problem belongs to the class of the arc routing problems.
The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NP-complete.
Problem (21) is made of an objective function and bounding constraints which all are ratios of two posynomials, making the problem belong to the class of CGP [38].
Problem (30) consists of an objective function and bounding constraints which all are ratios of two posynomials, making the problem belong to the class of CGP [31].
If we solve the problem belonging to denoted class R we can reduce its dimension by eliminating all unknowns outside the junction area.
Formally speaking, the problem belongs to the class of minimum cost network flow problems [10, 11] that are in general intractable (NP-hard) and involve optimal and/or heuristic algorithms and methods characterized by different types of time complexity [12, 13, 14, 15, 16, 17, 18, 19].
