Abstract
A variation of the partitioning problem is solved using linear programming techniques. In this class of problems, the optimal partition of objects must follow an apriori sequential ordering of objects. We examine a program segmentation application of this problem and formulate this sequential partitioning problem as an integer programming problem. The integer programming model of the problem possesses special structure such that the extreme points of its LP relaxation are integer and can be solved using LP techniques. We present computational results for randomly generated problems. We show how the LP approach can handle various side conditions and clustering criteria that arise across different problem types.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 679-686 |
| Number of pages | 8 |
| Journal | Computers and Operations Research |
| Volume | 24 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 1997 |
| Externally published | Yes |
ASJC Scopus subject areas
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research
Fingerprint Dive into the research topics of 'Partitioning of sequentially ordered systems using linear programming'. Together they form a unique fingerprint.
Cite this
Joseph, A., & Bryson, N. (1997). Partitioning of sequentially ordered systems using linear programming. Computers and Operations Research, 24(7), 679-686. https://doi.org/10.1016/S0305-0548(96)00070-6