A Polynomial Time Algorithm for Shaped Partition Problems

We consider the class of shaped partition problems of partitioning n given vectors in d-dimensional criteria space into p parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary constraints on the number of elements in each par...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on optimization Vol. 10; no. 1; pp. 70 - 81
Main Authors:	Hwang, Frank K., Onn, Shmuel, Rothblum, Uriel G.
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 1999
Subjects:	Algorithms Applied mathematics Graphs Polytopes Traveling salesman problem
ISSN:	1052-6234, 1095-7189
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!