Academic
Publications
Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets,10.1007/978-3-642-17458-2_13,Yakov Zinder,Julia Memar,Gaurav S

Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets  
BibTex | RIS | RefWorks Download
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.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.