Linear-shaped partition problems

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hwang, FK	en_US
dc.contributor.author	Onn, S	en_US
dc.contributor.author	Rothblum, UG	en_US
dc.date.accessioned	2014-12-08T15:45:19Z	-
dc.date.available	2014-12-08T15:45:19Z	-
dc.date.issued	2000-05-01	en_US
dc.identifier.issn	0167-6377	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0167-6377(99)00069-3	en_US
dc.identifier.uri	http://hdl.handle.net/11536/30546	-
dc.description.abstract	We establish the polynomial-time solvability of a class of vector partition problems with linear objectives subject to restrictions on the number of elements in each part. (C) 2000 Published by Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.title	Linear-shaped partition problems	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0167-6377(99)00069-3	en_US
dc.identifier.journal	OPERATIONS RESEARCH LETTERS	en_US
dc.citation.volume	26	en_US
dc.citation.issue	4	en_US
dc.citation.spage	159	en_US
dc.citation.epage	163	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000087249600003	-
dc.citation.woscount	6	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.