Please use this identifier to cite or link to this item:
|Title:||A decomposition approach for finding the setup number of a partial order|
McMaster University, Faculty of Business
|Series/Report no.:||Research and working paper series (McMaster University. Faculty of Business)|
|Abstract:||<p>Consider the linear extensions of a partial order. A setup occurs in a linear extension if two consecutive elements are unrelated in the partial order. The setup problem is to find a linear extension of the ordered set which contains the smallest possible number of setups. We present a decomposition approach for this problem. Based on this some new complexity results follow.</p>|
|Description:||<p>18, 7 leaves : ; Includes bibliographical references (leaves 14-15). ;</p>|
|Appears in Collections:||DeGroote School of Business Working Paper Series|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.