Discrete optimisation with polynomially detectable boundaries and restricted level sets

Publication Type:
Conference Proceeding
Lecture Notes in computer Science Vol 6508: Combinatorial Optimization and Applications - 4th Annual International Conference on Combinatorial Optimization and Applications, 2010, pp. 142 - 156
Issue Date:
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
Please use this identifier to cite or link to this item: