Linear-shaped partition problems
- 31 May 2000
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 26 (4), 159-163
- https://doi.org/10.1016/s0167-6377(99)00069-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Cutting CornersAdvances in Applied Mathematics, 1999
- Partition polytopes over 1-dimensional pointsMathematical Programming, 1999
- Separable partitionsDiscrete Applied Mathematics, 1999
- A Polynomial Time Algorithm for Shaped Partition ProblemsSIAM Journal on Optimization, 1999
- Representations and characterizations of vertices of bounded-shape partition polytopesLinear Algebra and its Applications, 1998
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive PartitionsMathematics of Operations Research, 1996
- Geometry, complexity, and combinatorics of permutation polytopesJournal of Combinatorial Theory, Series A, 1993
- Optimal partitions having disjoint convex and conic hullsMathematical Programming, 1992
- The Pareto set of the partition bargaining problemGames and Economic Behavior, 1991
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint ReplenishmentOperations Research, 1985