#### Filter Results:

#### Publication Year

1996

2017

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling Problem { the problem of choosing the s s principal submatrix with maximal determinant from a given n n positive deenite matrix, subject to linear constraints. We implement a branch-and-bound algorithm for the problem, using the new relaxation. The performance on test… (More)

We consider a new nonlinear relaxation for the Constrained Maximum Entropy Sampling Problem { the problem of choosing the s s principal submatrix with maximal determinant from a given n n positive deenite matrix, subject to linear constraints. We implement a branch-and-bound algorithm for the problem, using the new relaxation. The performance on test… (More)

We consider the \remote{sampling" problem of choosing a subset S, with jSj = s, from a set N of observable random variables so as to obtain as much information as possible about a set T of target random variables which are not directly observable. Our criterion is that of minimizing the entropy of T conditioned on S. We connne our attention to the case in… (More)

We describe improvements to Smith's branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR d. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by " merging " a new terminal node with each edge in the current Steiner tree. For a given topology we use a… (More)

The Euclidean Steiner Tree Problem in dimension greater than 2 is notoriously difficult. Successful methods for exact solution are not based on mathematical-optimization — rather, they involve very sophisticated enumeration. There are two types of mathematical-optimization formulations in the literature, and it is an understatement to say that neither… (More)

- Leo Liberti, Ali Amir, Ahmadi, Marcia Fampa, Bill Jackson, Nathan Krislock +2 others
- 2016

Materials from the workshop are available on the workshop website (dimacs.rutgers.edu/ Workshops/Distance). We are videotaping the four tutorial presentations, and the videos will be posted on the website when they are available. This map points out the five spots that are of interest for DGTA16 (see next page). 5 The following sites are shown on the map in… (More)