Learn More
A physical map has been constructed of the human genome containing 15,086 sequence-tagged sites (STSs), with an average spacing of 199 kilobases. The project involved assembly of a radiation hybrid map of the human genome containing 6193 loci and incorporated a genetic linkage map of the human genome containing 5264 loci. This information was combined with(More)
We give evidence that Single Tranferable Vote (STV) is computation-ally resistant to manipulation: It is NP-complete to determine whether there exists a (possibly insincere) preference that will elect a favored candidate , even in an election for a single seat. Thus strategic voting under STV is qualitatively more difficult than under other commonly-used(More)
In this paper, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form Σ (i,j)∈Q ij ij F (w) + Σ i∈P i i B () µ), the constraints are similar to those arising in the dual of a minimum cost flow problem (that is, of the form µ i-µ j ≤ w ij , (i, j) ∈ Q), with lower and(More)
In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 be a given feasible solution. The solution x 0 may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to(More)
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network with <italic>n</italic> vertices, <italic>m</italic> edges, and nonnegative integer arc costs bounded by <italic>C</italic>, a one-level form of radix heap gives a(More)