Discrete optimization with polynomially detectable boundaries and restricted level sets

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, 6508 LNCS (PART 1), pp. 142 - 156
Issue Date:
2010-12-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004997OK.pdf469.59 kB
Adobe PDF
The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function. It is shown that these properties are possessed, for example, by various scheduling problems, including a number of well-known NP-hard problems which play an important role in scheduling theory. For an important particular case the presented optimization procedure is compared with a version of the branch-and-bound algorithm by means of computational experiments. © 2010 Springer-Verlag.
Please use this identifier to cite or link to this item: