Discrete Optimization With Polynomially Detectable Boundaries And Restricted Level Sets

Publication Type:
Journal Article
Combinatorial Optimization and Applications, 2013, 25 (2), pp. 308 - 325
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012004029OK.pdf574.29 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 one of these problems 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: