A Branch-and-Bound Algorithm for Pagination

Duncan, John; Scott, Lawrence

doi:10.1287/opre.23.2.240

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar implicit enumeration approaches have been used by Graves and Winston for quadratic assignment problems [16], Duncan and Scott for a virtual storage computer paging problem [17], and Liggett for a school districting problem [9].…”

Section: Techniqurs For Defining Health Region Boundarb$smentioning

confidence: 97%

Techniques for defining geographic boundaries for health regions

Thomas

1979

Socio-Economic Planning Sciences

View full text Add to dashboard Cite

Many federal and state programs require the geographic partitioning of states into regions for health services planning, monitoring, and/or administration. A common consideration for such programs is that region boundaries should be drawn so as to maximize the proportion of the state's population that receives health care services in its region of residence. Defining region boundaries thus may be viewed as a problem of partitioning a set of N small area1 units (e.g. counties) into M subsets (regions) so as to minimize interactions (patient flow) among subsets. This paper describes three algorithms for region design and compares them in terms of computerprocessing efficiency and solution value based on results from a number of test cases. Application of two of the algorithms, one based on the greedy heuristic and the other incorporating a max-flowlmin-cut procedure, to a problem of dividing a metropolitan region into separate service areas for clusters of hospitals is also described.

show abstract

Section: Techniqurs For Defining Health Region Boundarb$smentioning

confidence: 97%

Techniques for defining geographic boundaries for health regions

Thomas

1979

Socio-Economic Planning Sciences

View full text Add to dashboard Cite

show abstract

“…In the worst case, a given tile might successively overload and be removed from all pages, whose to- 6 Strictly speaking, with this post-treatment, Best Fusion is no more greedy. Preserving at the same time the greediness of the algorithms of the present family, and an acceptable behavior on both Section 3.1.2's and pure Bin Packing's instances, can nevertheless be attained by means of offline scheduling (described in Section 3.2.1).…”

Section: Algorithm: Overload-and-removementioning

confidence: 99%

“…The problem studied in[6], and coincidentally named pagination (by reference to the fixed-length contiguous block of virtual memory, or memory-pages), is in fact a special case of Hypergraph Partitioning, where the objective is to minimize the total weight of edge-cuts in a weighted graph, with an upper bound on the size of the parts.…”

mentioning

confidence: 99%

Algorithms for the bin packing problem with overlapping items

Grange

Kacem²

2018

Computers & Industrial Engineering

View full text Add to dashboard Cite

We study an extension of the bin packing problem, where packing together two or more items may make them occupy less volume than the sum of their individual sizes. To achieve this property, an item is defined as a finite set of symbols from a given alphabet. Unlike the items of Bin Packing, two such sets can share zero, one or more symbols. The problem was first introduced in 2011 by Sindelar et al. [19] under the name of VM Packing with the addition of hierarchical sharing constraints making it suitable for virtual machine colocation. Without these constraints, we prefer the more general name of Pagination. After formulating it as an integer linear program, we try to approximate its solutions with several families of algorithms: from straightforward adaptations of classical Bin Packing heuristics, to dedicated algorithms (greedy and non-greedy), to standard and grouping genetic algorithms. All of them are studied first theoretically, then experimentally on an extensive random test set. Based upon these data, we propose a predictive measure of the statistical difficulty of a given instance, and finally recommend which algorithm should be used in which case, depending on either time constraints or quality requirements.

show abstract

Einsatzmöglichkeiten von quantitativen Verfahren und OR-Modellen für das DV-Management

Stahlknecht

1981

OR Spektrum

View full text Add to dashboard Cite

A Branch-and-Bound Algorithm for Pagination

Cited by 4 publications

References 8 publications

Techniques for defining geographic boundaries for health regions

Techniques for defining geographic boundaries for health regions

Algorithms for the bin packing problem with overlapping items

Einsatzmöglichkeiten von quantitativen Verfahren und OR-Modellen für das DV-Management

Contact Info

Product

Resources

About