Linear-shaped partition problems

DOI10.1016/S0167-6377(99)00069-3zbMath0955.90117OpenAlexW1996672913MaRDI QIDQ1577471

Frank K. Hwang, Uriel G. Rothblum, Shmuel Onn

Publication date: 4 September 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00069-3

zbMATH Keywords

polynomial-time solvabilitylinear objectivesshaped partition problemvector partition problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19 ⋮ Biclustering in data mining ⋮ Vertex characterization of partition polytopes of bipartitions and of planar point sets

Cites Work

• Unnamed Item
• Geometry, complexity, and combinatorics of permutation polytopes
• Optimal partitions having disjoint convex and conic hulls
• The Pareto set of the partition bargaining problem
• Separable partitions
• Partition polytopes over 1-dimensional points
• Representations and characterizations of vertices of bounded-shape partition polytopes
• Geometric algorithms and combinatorial optimization.
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• A Polynomial Time Algorithm for Shaped Partition Problems
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• Cutting corners

This page was built for publication: Linear-shaped partition problems