Linear-shaped partition problems

Authors:
Frank K Hwang;Shmuel Onn;Uriel G Rothblum
Affiliations:
Department of Applied Mathematics, Chiaotung University, Hsinchu, 30045, Taiwan;Davidson Faculty of IE & M, Technion - Israel Institute of Technology, 32000 Haifa, Israel;Davidson Faculty of IE & M, Technion - Israel Institute of Technology, 32000 Haifa, Israel
Venue:
Operations Research Letters
Year:
2000

Citing 6
Cited 2

Theory of linear and integer programming

Theory of linear and integer programming
Optimal partitions having disjoint convex and conic hulls

Mathematical Programming: Series A and B
Geometry, complexity, and combinatorics of permutation polytopes

Journal of Combinatorial Theory Series A
Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions

Mathematics of Operations Research
Separable partitions

Discrete Applied Mathematics
A Polynomial Time Algorithm for Shaped Partition Problems

SIAM Journal on Optimization

Vertex characterization of partition polytopes of bipartitions and of planar point sets

Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Biclustering in data mining

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.