Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/5456| Title: | A decomposition approach for finding the setup number of a partial order |
| Authors: | Steiner, George McMaster University, Faculty of Business |
| Publication Date: | Apr-1984 |
| Series/Report no.: | Research and working paper series (McMaster University. Faculty of Business) no. 220 |
| 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> |
| URI: | http://hdl.handle.net/11375/5456 |
| Identifier: | dsb/118 1117 4944141 |
| Appears in Collections: | DeGroote School of Business Working Paper Series |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| fulltext.pdf | 618.07 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.
