Reformulation of the set partitioning problem as apure network with special order set constraints

Agha Iqbal Ali

Annals of Operations Research, 1998, vol. 81, issue 0, 233-250

Abstract: In this paper, the set partitioning problem is reformulated as a network flow problemwith special order sets. The reformulation is based on identifying network structure that ishidden in the element-set incidence matrix. The special order sets and the revealed networkin the reformulation together define an effective structure for solution by enumeration. Theresulting enumeration procedure for the solution of the set partitioning problem is computationallyadvantageous since it uses a pure network relaxation that is solved using reoptimization,allows a large number of variables to be fixed in a subproblem, and is defined overa relatively small enumeration tree. Computational experience is included. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018953006796 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:233-250:10.1023/a:1018953006796

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018953006796

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().