Partitioning of sequentially ordered systems using linear programming

DOI10.1016/S0305-0548(96)00070-6zbMath0882.90097OpenAlexW2068057816MaRDI QIDQ1362974

Anito Joseph, N. A. Bryson

Publication date: 10 March 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00070-6

zbMATH Keywords

program segmentationsequential partitioning

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

A hybrid clustering algorithm ⋮ A polyhedral study of lifted multicuts

Uses Software

• LINDO
• OSL

Cites Work

• Optimal partitions
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
• On Grouping for Maximum Homogeneity
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Structured Partitioning Problems
• The Optimal Partitioning of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Unresolved Problems in Cluster Analysis
• Integer Programming and the Theory of Grouping
• Optimal Sequential Partitions of Graphs
• Cluster Analysis and Mathematical Programming

This page was built for publication: Partitioning of sequentially ordered systems using linear programming