Discrete optimization with polynomially detectable boundaries and restricted level sets

Authors:
Yakov Zinder;Julia Memar;Gaurav Singh
Affiliations:
University of Technology, Sydney, Australia 2007;University of Technology, Sydney, Australia 2007;CSIRO, South Clayton, Australia 3169
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 4
Cited 0

Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Discrete Applied Mathematics
Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
NP-complete scheduling problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.