A Branch-and-Bound Algorithm for Pagination

John Duncan and Lawrence W. Scott
Additional contact information
John Duncan: University of Miami, Coral Gables, Florida
Lawrence W. Scott: University of Miami, Coral Gables, Florida

Operations Research, 1975, vol. 23, issue 2, 240-259

Abstract: The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a randomly selected solution is inferior to the final.” The algorithm can be used to segment computer programs and data libraries when statistics on the transition or reference rates among program or data elements are known. Numerical results demonstrate the feasibility of efficiently partitioning 50-node graphs.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.2.240 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:2:p:240-259

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().