Sentence examples for case of this problem from inspiring English sources

A special case of this problem is a weighted edge cover problem with k cost functions on the vertices.

This paper examines a special case of this problem, finding the number of n-step "up-side" saws (ussaws), saws restricted to moving up and sideways.

A textbook case of this problem occurred in New York in 2009, when producers staged a so-called "Neil Simon Season", comprising, somewhat oddly, the first and third parts of his BB trilogy.

Our main result is that even a very special case of this problem cannot be approximated to within a factor 2log1−ε|D| if D is the set of demands.

A special case of this problem (k= 2 and j= 1) was recently studied by Hirvensalo and Karhumaki [M.Hirvensalo, J.Karhumaki, Computing partial information out of uncomputable one The first digit of 2n to base 3 as an example, in: Mathematical Foundations of Computer Science, in: Lecture Notes in Computer Science, Springer-Verlag, Inc., 2002] for which they presented a polynomial time algorithm.

In this paper, we report a case of this problem.

Some Japanese firms are textbook cases of this problem.

Special cases of this problem include the assignment problem and the traveling salesman problem (TSP).

We establish computational complexity of various special cases of this problem, present constructive heuristic algorithms, integer linear programs as well as computational results.

We report three polynomial-time solvable cases of this problem with (a) identical order quantities; (b) designated suppliers; and (c) divisible customer order sizes.

Some special cases of this problem may be found in [24 28].