Discrete optimisation with polynomially detectable boundaries and restricted level sets

UTSePress Research/Manakin Repository

Search UTSePress Research

Advanced Search


My Account

Show simple item record

dc.contributor.author Zinder, Yakov en_US
dc.contributor.author Memar, Julia en_US
dc.contributor.author Singh, G. en_US
dc.contributor.editor Donghyun Kim en_US
dc.date.accessioned 2012-02-02T11:06:00Z
dc.date.available 2012-02-02T11:06:00Z
dc.date.issued 2010 en_US
dc.identifier 2010004997 en_US
dc.identifier.citation Zinder Yakov, Memar Julia, and Singh G. 2010, 'Discrete optimisation with polynomially detectable boundaries and restricted level sets', , Kailua-Kona, Germany, , pp. 142-156. en_US
dc.identifier.issn 978-3-642-17457-5 en_US
dc.identifier.other E1UNSUBMIT en_US
dc.identifier.uri http://hdl.handle.net/10453/16069
dc.description.abstract 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 en_US
dc.language en_US
dc.publisher Kailua-Kona en_US
dc.relation.isbasedon http://dx.doi.org/10.1007/978-3-642-17458-2_13 en_US
dc.title Discrete optimisation with polynomially detectable boundaries and restricted level sets en_US
dc.parent Lecture Notes in computer Science Vol 6508: Combinatorial Optimization and Applications - 4th Annual International Conference on Combinatorial Optimization and Applications en_US
dc.journal.volume en_US
dc.journal.number en_US
dc.publocation Germany en_US
dc.identifier.startpage 142 en_US
dc.identifier.endpage 156 en_US
dc.cauo.name SCI.Mathematical Sciences en_US
dc.conference Verified OK en_US
dc.for 010200 en_US
dc.personcode 930901 en_US
dc.personcode 102669 en_US
dc.personcode 0000070210 en_US
dc.percentage 100 en_US
dc.classification.name Applied Mathematics en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom international conference on Combinatorial optimization and applications en_US
dc.date.activity 20101218 en_US
dc.location.activity USA en_US
dc.description.keywords discrete optimization - scheduling theory - parallel machines - unit execution time en_US
dc.staffid en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record