Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

On unsolvability of vector problems of discrete optimization with the help of algorithms of linear convolution

descriptionPublicationkeyboard_double_arrow_right Article Publisher:Navuka i Tehkhnika, Minsk
Authors: Kravtsov, M. K.;

On unsolvability of vector problems of discrete optimization with the help of algorithms of linear convolution

Abstract

Summary: It is proved that vector problems on graphs and a variety of Boolean programming problems cannot be solved by means of linear convolution algorithms.

Keywords

Integer programming, Boolean programming, linear convolution algorithms

Powered by OpenAIRE graph
Found an issue? Give us feedback