Partitioning of sequentially ordered systems using linear programming

Anito Joseph, Noel Bryson

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)679-686
Number of pages8
JournalComputers and Operations Research
Volume24
Issue number7
DOIs
StatePublished - Jan 1 1997
Externally publishedYes

Fingerprint

Integer programming
Linear programming
Partitioning
Integer Programming
Optimal Partition
LP Relaxation
Extreme Points
Programming Model
Computational Results
Segmentation
Clustering
Integer

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

Partitioning of sequentially ordered systems using linear programming. / Joseph, Anito; Bryson, Noel.

In: Computers and Operations Research, Vol. 24, No. 7, 01.01.1997, p. 679-686.

Research output: Contribution to journalArticle

@article{1429de0f1fda40b3bfb167434efa1631,
title = "Partitioning of sequentially ordered systems using linear programming",
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.",
author = "Anito Joseph and Noel Bryson",
year = "1997",
month = "1",
day = "1",
doi = "10.1016/S0305-0548(96)00070-6",
language = "English (US)",
volume = "24",
pages = "679--686",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Partitioning of sequentially ordered systems using linear programming

AU - Joseph, Anito

AU - Bryson, Noel

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031192691&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031192691&partnerID=8YFLogxK

U2 - 10.1016/S0305-0548(96)00070-6

DO - 10.1016/S0305-0548(96)00070-6

M3 - Article

VL - 24

SP - 679

EP - 686

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 7

ER -