A decomposition approach for finding the setup number of a partial order

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/5456

Full metadata record

DC Field	Value	Language
dc.contributor.author	Steiner, George	en_US
dc.contributor.author	McMaster University, Faculty of Business	en_US
dc.date.accessioned	2014-06-17T20:39:07Z	-
dc.date.available	2014-06-17T20:39:07Z	-
dc.date.created	2013-12-23	en_US
dc.date.issued	1984-04	en_US
dc.identifier.other	dsb/118	en_US
dc.identifier.other	1117	en_US
dc.identifier.other	4944141	en_US
dc.identifier.uri	http://hdl.handle.net/11375/5456	-
dc.description	<p>18, 7 leaves : ; Includes bibliographical references (leaves 14-15). ;</p>	en_US
dc.description.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>	en_US
dc.relation.ispartofseries	Research and working paper series (McMaster University. Faculty of Business)	en_US
dc.relation.ispartofseries	no. 220	en_US
dc.subject.lcc	Decomposition (Mathematics) Algorithms	en_US
dc.title	A decomposition approach for finding the setup number of a partial order	en_US
dc.type	article	en_US
Appears in Collections:	DeGroote School of Business Working Paper Series

Files in This Item:

File	Size	Format
fulltext.pdf Open Access	618.07 kB	Adobe PDF	View/Open