Discrete optimization with polynomially detectable boundaries and restricted level sets

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Zinder, Y
dc.contributor.author Memar, J
dc.contributor.author Singh, G
dc.date.accessioned 2012-02-02T11:06:00Z
dc.date.issued 2010
dc.date.issued 2010
dc.identifier.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
dc.identifier.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
dc.identifier.isbn 3642174574
dc.identifier.isbn 3642174574
dc.identifier.isbn 9783642174575
dc.identifier.isbn 9783642174575
dc.identifier.issn 0302-9743
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. © 2010 Springer-Verlag.
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. © 2010 Springer-Verlag.
dc.relation.isbasedon 10.1007/978-3-642-17458-2_13
dc.relation.isbasedon 10.1007/978-3-642-17458-2_13
dc.title Discrete optimization with polynomially detectable boundaries and restricted level sets
dc.title Discrete optimization with polynomially detectable boundaries and restricted level sets
dc.type Conference Proceeding
dc.description.version Published
dc.parent Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.parent Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.journal.volume PART 1
dc.journal.volume PART 1
dc.journal.volume 6508 LNCS
dc.journal.volume 6508 LNCS
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.conference 4th Annual International Conference on Combinatorial Optimization and Applications
dc.for 0102 Applied Mathematics
dc.personcode 930901
dc.personcode 102669
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.date.activity 2010-12-18
dc.location.activity USA en_US
dc.location.activity Kailu Kona, HI
dc.description.keywords discrete optimization
dc.description.keywords discrete optimization
dc.description.keywords parallel machines
dc.description.keywords parallel machines
dc.description.keywords scheduling theory
dc.description.keywords scheduling theory
dc.description.keywords unit execution times
dc.description.keywords unit execution times
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Science
pubs.organisational-group /University of Technology Sydney/Faculty of Science/School of Mathematical Sciences
pubs.organisational-group /University of Technology Sydney/Students
utslib.copyright.status Closed Access
utslib.copyright.date 2015-04-15 12:17:09.805752+10
pubs.consider-herdc false
utslib.collection.history Closed (ID: 3)
utslib.collection.history School of Mathematical Sciences (ID: 340)
utslib.collection.history School of Mathematical Sciences (ID: 340)


Files in this item

This item appears in the following Collection(s)

Show simple item record