Een indelingsprobleem

Jac. M. Anthonisse

Statistica Neerlandica, 1968, vol. 22, issue 2, 103-118

Abstract: Summary A branch and bound algorithm is given to solve the following problem: To each pair of elements (i,j) from a set X={l,…, n} a number rij with rij≥ 0, rij=rij and rij= 0 has been assigned. Find a prescribed number of disjoint subsets P1…,Pm from X, such that Experiments indicate that an optimal solution is usually found in a small number of iterations, but the verification may be rather time consuming. The algorithm may be used to find the minimum value of m for which a partitioning of X with z= 0 exists. The algorithm appears to be efficient for finding this ‘chromatic number of a graph’.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1968.tb01360.x

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:bla:stanee:v:22:y:1968:i:2:p:103-118

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().