post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

The optimality signs of feasible solutions of intractable combinatorial optimization problems

Pavlov A.A.

In the article for several types of intractable single-stage scheduling problems the optimality signs of a feasible solution are formulated which are the theoretical basis for the construction the polynomial component of the PDC-algorithms for these problems.

Завантажити (pdf)