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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
