Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- bookMay 2018
Linear and Integer Programming Made Easy
This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The ...
- bookMay 2016
Linear and Integer Programming Made Easy
This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The ...
- research-articleNovember 2006
Prim-Dijkstra tradeoffs for improved performance-driven routing tree design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCADICS), Volume 14, Issue 7Pages 890–896https://doi.org/10.1109/43.391737Analysis of Elmore delay in distributed RC tree structures shows the influence of both tree cost and tree radius on signal delay in VLSI interconnects. We give new and efficient interconnection tree constructions that smoothly combine the minimum cost ...
- research-articleNovember 2006
A multi-probe approach for MCM substrate testing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCADICS), Volume 13, Issue 1Pages 110–121https://doi.org/10.1109/43.273744Multi-chip module (MCM) technology has become an important means to package high performance systems. An important task during the packaging process is to check for possible open, short, and high resistance faults in the wiring networks of the bare MCM ...
- bookJanuary 2002
-
- reportJune 1999
Minimax Programs and Bitonic Column Matrices
This report describes an optimization problem called a minimax program that is similar to a linear program, except that the addition operator is replaced by the maximum operator in the constraint inequalities. The relation of this problem to some well-...
- reportJune 1999
Min Cuts Without Path Packing
This report presents research into a fundamentally new approach to finding all pairwise minimum cuts in a network that can utilize optimality conditions other than those characterized by Mengers theorem or the max-flow min-cut theorem. The focus is on ...
- research-articleDecember 1992
Maximum concurrent flows and minimum cuts
AbstractIn many applications, we need to find a minimum cost partition of a network separating a given pair of nodes. A classical example is the Max-Flow Min-Cut Theorem, where the cost of the partition is defined to be the sum of capacities of arcs ...
- research-articleJune 1991
The Orientation of Modules Based on Graph Decomposition
IEEE Transactions on Computers (ITCO), Volume 40, Issue 6Pages 774–780https://doi.org/10.1109/12.90255In the layout stage of VLSI and printed circuit board (PCB) design, after all circuit modules (rectangular) are placed, it is possible to flip the modules so as to reduce the total net length. The authors formulate the orientation of modules as a graph ...
- articleJanuary 1985
Triangulations (tilings) and certain block triangular matrices
Mathematical Programming: Series A and B (MPRG), Volume 31, Issue 1Pages 1–14https://doi.org/10.1007/BF02591857For a convex polygonP withn sides, a `partitioning' ofP intonź2 nonoverlapping triangles each of whose vertices is a vertex ofP is called a triangulation or tiling, and each triangle is a tile. Each tile has a given cost associated with it which may ...
- research-articleMay 1982
Computation of Matrix Chain Products. Part I
This paper considers the computation of matrix chain products of the form $M_1 \times M_2 \times \cdots \times M_{n - 1} $. If the matrices are of different dimensions, the order in which the product is computed affects the number of operations. An ...
- bookJanuary 1982
- reportSeptember 1981
Computation of matrix chain products: Part I, Part II
This paper considers the computation of matrix chain products of the form $M_1 x M_2 x ... x M_{n-1}$. If the matrices are of different dimensions, the order in which the product is computed affects the number of operations. An optimum order is an order ...