A new relaxation for the set problems

Farhad Djannaty, Muhammad Yarali


Set problems (SP) are an important class of combinatorial optimization problems which have many practical applications. Network relaxations of SP are alternative ways of relaxing the problem to find quick lower bound on the value of the objective function. Inspired by these relaxations, a new simple and much faster relaxation of the set problems is proposed. Using a standard cost allocation strategy and an innovative, the new relaxation is applied to a number of standard SP test problems and computational results are presented.

Full Text: PDF

How to Cite this Article:

Farhad Djannaty, Muhammad Yarali, A new relaxation for the set problems, Journal of Mathematical and Computational Science, Vol 5, No 2 (2015), 237-245

Copyright © 2015 Farhad Djannaty, Muhammad Yarali. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org


Copyright ©2019 JMCS