Network planning with random demand S Sen, RD Doverspike, S Cosares Telecommunication systems 3 (1), 11-30, 1994 | 277 | 1994 |
An optimization problem related to balancing loads on SONET rings S Cosares, I Saniee Telecommunication Systems 3, 165-181, 1994 | 183 | 1994 |
SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks S Cosares, DN Deutsch, I Saniee, OJ Wasem Interfaces 25 (1), 20-40, 1995 | 146 | 1995 |
Method for efficiently determining the direction for routing a set of anticipated demands between selected nodes on a ring communication network ST Cosares, I Saniee, OJ Wasem US Patent 5,546,542, 1996 | 69 | 1996 |
An algorithm for the detection and construction of Monge sequences N Alon, S Cosares, DS Hochbaum, R Shamir Linear Algebra and its Applications 114, 669-680, 1989 | 53 | 1989 |
Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources S Cosares, DS Hochbaum Mathematics of Operations Research 19 (1), 94-111, 1994 | 46 | 1994 |
Demand routing and slotting on ring networks T Carpenter, S Cosares, I Saniee Technical Report 97-02, Bellcore, 1997 | 38* | 1997 |
A strongly polynomial algorithm for a special class of linear programs I Adler, S Cosares Operations Research 39 (6), 955-960, 1991 | 32 | 1991 |
A bound of 4 for the diameter of the symmetric traveling salesman polytope FJ Rispoli, S Cosares SIAM Journal on Discrete Mathematics 11 (3), 373-380, 1998 | 31 | 1998 |
Network planning with the SONET toolkit S Cosares, I Saniee, O Wasem Bellcore Exchange 813, 1992 | 19 | 1992 |
A simple approximation algorithm for two problems in circuit design T Carpenter, S Cosares, JL Ganley, I Saniee IEEE transactions on computers 47 (11), 1310-1312, 1998 | 15 | 1998 |
Comparing heuristics for demand routing and slot assignment on ring networks T Carpenter, S Cosares Telecommunication Systems 21, 319-337, 2002 | 9 | 2002 |
Strongly polynomial algorithms for linear programming problems with special structure I Adler, S Cosares Unpublished manuscript, 1989 | 8 | 1989 |
On the complexity of some primal-dual linear programming pairs. ST Cosares Dissertation Abstracts International Part B: Science and Engineering[DISS …, 1989 | 6 | 1989 |
The Fibonacci hypercube FJ Rispoli, S Cosares AUSTRALASIAN JOURNAL OF COMBINATORICS 40, 187, 2008 | 5 | 2008 |
Static routing and slotting of demand in sonet rings S Cosares, T Carpenter, I Saniee TIMS/ORSA Joint National Meeting, Boston, MA 148, 1994 | 5 | 1994 |
Advantageous properties of dual transhipment polyhedra I Adler, S Cosares SIAM Journal on Discrete Mathematics 3 (2), 157-167, 1990 | 4 | 1990 |
Generating a Family of Optimal Glide Paths for Investment Planning with Target Dates S Cosares The Journal of Wealth Management 16 (3), 43, 2013 | 2 | 2013 |
Models for Decision-Making S Cosares, F Rispoli | 1 | 2023 |
The “Knapsack Problem” Workbook: An Exploration of Topics in Computer Science S Cosares | 1 | 2021 |