We study in this paper a new channel pin assignment problem for the new cell model in which all the pins are positioned along a horizontal line inside their corresponding cells. An exact algorithm is presented, and its application to over-the-cell routing is also addressed.

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

Recently, Waldmann considered an algorithm to compute the aggregate claims distribution in the individual life model which is an efficient reformulation of the original exact algorithm of De Pril. In this paper we will show that in practice the approximations as proposed by De Pril are still more efficient than the exact algorithm of Waldmann both in terms of the number of computations required...

Given a graph G = (V, E) with a length function on edges and a subset R of V , the full Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the full Steiner tree problem is to find a full Steiner tree in G with minimum length, and the bottleneck full Steiner tree problem is to find a full Steiner tree T in G such that the length of the largest edge i...

In this article we first review previous integer formulations for the maximum diversity problem. This problem consists of selecting a subset of elements from a data set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and expressions for upper bounds for this problem. As far as we know, this is the first exact algorith...

Some fast exact algorithms for the maximum weight clique problem have been proposed. Östergård’s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that the straightforwardly implemented Kumlander’s algorithm is slower than Östergård’s algorithm. We propose some improvements on Kumlander’s algorithm. Keywords—Maximum weight clique, exact algorithm, branch...

The complexity of an algorithm is usually specied by the maximum number of steps made by the algorithm, as a function of the size of the input. However, as dierent inputs of equal size can yield dramatically dierent algorithm runtime, the size of the input is not always an appropriate basis for predicting algorithm runtime. In this paper, we argue that the compressed size of the input is more a...

Centralised matching programs have been established in several countries to organise kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually the goal is to maximise the number of transpla...

A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...