Sentence examples for optimization versions from inspiring English sources

Consequently much effort has been put into finding efficient algorithms for solving both the decision and optimization versions of \(\sc{TSP}\).

Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem.

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such.

It is known that the problem is NP-hard and its optimization version admits a polynomial time approximation scheme (PTAS).

The optimization version of the problem is to find the smallest ξ for which a routing of this kind exists.

We develop exact formulations of the correlation clustering task as Maximum Satisfiability (MaxSAT), the optimization version of the Boolean satisfiability (SAT) problem.

Whereas many complexity results exist for the optimization version of the problem, complexity for the decision variant, which from a practical point of view is more important, is widely unknown.

Maximization (18) is the optimization version of the set packing problem, which is shown to be NP-hard [30].

For instance the optimization version of the problem \(\sc{VERTEX}\ \sc{COVER}\) defined below possesses a simple polynomial time approximation algorithm which allows us to find a solution (i.e. a set of vertices including at least one from each edge of the input graph) which is no larger than twice the size of an optimal solution.

[ 12] The optimization version where the smallest covering set has to be found is NP-hard.

The MaxSAT problem is an optimization version of the well-known Boolean satisfiability problem (SAT) (Biere et al., 2009).