A generic FPTAS for partition type optimisation problems
by Mikhail Y. Kovalyov; Wieslaw Kubiak
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 3, 2012

Abstract: A partition type optimisation problem (problem PT_opt) defined on partitions of a set is introduced. Its objective function is a composition of a number of auxiliary recursively computable functions. The conditions on the composition and the auxiliary functions sufficient for developing a fully polynomial time approximation scheme (FPTAS) for PT_opt are established. An FPTAS for PT_opt is given under these conditions. Several well-known discrete optimisation and scheduling problems are shown to be special cases of the problem PT_opt and meet the sufficient conditions. This results into FPTASes for some new problems, and generalises several existing FPTASes under one framework.

Online publication date: Wed, 29-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Planning and Scheduling (IJPS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com