Discrete optimization with polynomially detectable boundaries and restricted level sets

Zinder, Y; Memar, J; Singh, G

Discrete optimization with polynomially detectable boundaries and restricted level sets

Zinder, Y

Memar, J

Singh, G

Permalink

Publication Type:: Journal Article
Citation:: Journal of Combinatorial Optimization, 2013, 25 (2), pp. 308 - 325
Issue Date:: 2013-01-01

Closed Access

	Filename	Description	Size
	2012004029OK.pdf		574.29 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.contributor.author	Memar, J https://orcid.org/0000-0003-2395-1450	en_US
dc.contributor.author	Singh, G	en_US
dc.date.issued	2013-01-01	en_US
dc.identifier.citation	Journal of Combinatorial Optimization, 2013, 25 (2), pp. 308 - 325	en_US
dc.identifier.issn	1382-6905	en_US
dc.identifier.uri	http://hdl.handle.net/10453/27419
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 one of these problems the presented optimization procedure is compared with a version of the branch-and-bound algorithm by means of computational experiments. © 2012 Springer Science+Business Media, LLC.	en_US
dc.relation.ispartof	Journal of Combinatorial Optimization	en_US
dc.relation.isbasedon	10.1007/s10878-012-9546-z	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Discrete optimization with polynomially detectable boundaries and restricted level sets	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	25	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	010303 Optimisation	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
pubs.embargo.period	Not known	en_US
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 and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	25	en_US

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 one of these problems the presented optimization procedure is compared with a version of the branch-and-bound algorithm by means of computational experiments. © 2012 Springer Science+Business Media, LLC.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/27419