Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment

DOI10.1287/opre.33.4.820zbMath0588.90076MaRDI QIDQ3716830

Amiya K. Chakravarty, James B. Orlin, Uriel G. Rothblum

Publication date: 1985

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

Full work available at URL: https://semanticscholar.org/paper/a56d64c48dac35b30e928f8f6df4ade7e5e71537

zbMATH Keywords

polynomial time; joint replenishment; grouping; partition problem; statistical hypothesis testing; inventory groupings; semiconsecutiveness

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C30: Nonlinear programming

05A17: Combinatorial aspects of partitions of integers

90B05: Inventory, storage, reservoirs

Related Items

Constrained partitioning problems, The performance ratio of grouping policies for the joint replenishment problem, Incorporating inventory and routing costs in strategic location models, Optimal multi-product inventory grouping for coordinated periodic replenishment under stochastic demand, Localizing combinatorial properties of partitions, Optimal partitions having disjoint convex and conic hulls, The Pareto set of the partition bargaining problem, Optimal policies for the capacitated two stage multi-item inventory model with joint setup costs, Optimal mapping in direct mapped cache environments, The general multi-retailer EOQ problem with vehicle routing costs, Partitioning of sequentially ordered systems using linear programming, Linear-shaped partition problems, Enumerating nested and consecutive partitions, Vertex characterization of partition polytopes of bipartitions and of planar point sets, Optimal Set Partitioning