Learn More
The capacitated miinimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The CMST problem is an NP-complete problem, and existing exact algorithms can solve only small size problems. Currently, the best available heuristic procedures(More)
The capacitated minimum spanning tree (CMST) problem is to ÿnd a minimum cost spanning tree in a network where nodes have speciÿed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design(More)
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n ≤ 25). Neighborhood search algorithms are(More)
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extreme point, for solving a class of linear programs with countably infinite variables and constraints. Each iteration of this method can be implemented in finite time, while the(More)
This paper presents a novel approach towards the simultaneous Vt-assignment and gate-sizing problem. This inherently discrete problem is formulated as a continuous problem, allowing it to be solved using any of several widely available and highly efficient non-linear optimizers. We prove that, under our formulation, the optimal solution has discrete Vts(More)
We show corroborating evidence that, among a set of common acoustic parameters, the clarity index C 50 provides a measure of reverberation that is well correlated with speech recognition accuracy. We also present a data driven method for non-intrusive C 50 parameter estimation from a single channel speech signal. The method extracts a number of features(More)