The Bounded Cycle-Cover Problem. - Dorit S. Hochbaum; Eli V. Olinick (INFORMS J. Comput., 2001)

Baseball, Optimization, and the World Wide Web. - Ilan Adler; Alan L. Erera; Dorit S. Hochbaum; Eli V. Olinick (Interfaces, 2002)

SONET/SDH Ring Assignment with Capacity Constraints. - Olivier Goldschmidt; Alexandre Laugier; Eli V. Olinick (Discret. Appl. Math., 2003)

An Incremental Procedure for Improving Path Assignment in a Telecommunications Network. - D. Allen; Iszaidy Ismail; Jeffery L. Kennington; Eli V. Olinick (J. Heuristics, 2003)

Wavelength Routing and Assignment in a Survivable WDM Mesh Network. - Jeffery L. Kennington; Eli V. Olinick; Augustyn Ortynski; Gheorghe Spiride (Oper. Res., 2003)

The SONET edge-partition problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick (Networks, 2003)

Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. - Jeffery L. Kennington; Eli V. Olinick (INFORMS J. Comput., 2004)

Hierarchical cellular network design with channel allocation. - Joakim Kalvenes; Jeffery L. Kennington; Eli V. Olinick (Eur. J. Oper. Res., 2005)

Base Station Location and Service Assignments in W - CDMA Networks. - Joakim Kalvenes; Jeffery L. Kennington; Eli V. Olinick (INFORMS J. Comput., 2006)

Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures. - Giray Birkan; Jeffery L. Kennington; Eli V. Olinick; Augustyn Ortynski; Gheorghe Spiride (Telecommun. Syst., 2006)

Optimizing revenue in CDMA networks under demand uncertainty. - Eli V. Olinick; Jay M. Rosenberger (Eur. J. Oper. Res., 2008)

The use of sparsest cuts to reveal the hierarchical community structure of social networks. - Charles F. Mann; David W. Matula; Eli V. Olinick (Soc. Networks, 2008)

Incremental demand rerouting: optimization models and algorithms. - Eli V. Olinick; Tauhid M. Rahman (Telecommun. Syst., 2011)

The Vanpool Assignment Problem: Optimization models and solution algorithms. - Levent Kaan; Eli V. Olinick (Comput. Ind. Eng., 2013)

A Systems Engineering Approach to Improving the Accuracy of Mobile Station Location Estimation. - Reza Rahdar; Jerrell T. Stracener; Eli V. Olinick (IEEE Syst. J., 2014)

A compact linear programming formulation of the maximum concurrent flow problem. - Yuanyuan Dong; Eli V. Olinick; T. Jason Kratz; David W. Matula (Networks, 2015)

WhiteMesh: Leveraging white spaces in wireless mesh networks. - Pengfei Cui; Yuanyuan Dong; Hui Liu 027; Dinesh Rajan; Eli V. Olinick; Joseph Camp (WiOpt, 2016)

Swapped face detection using deep learning and subjective assessment. - Xinyi Ding 001; Zohreh Raziei; Eric C. Larson; Eli V. Olinick; Paul Krueger; Michael Hahsler (EURASIP J. Inf. Secur., 2020)

Bounds on maximum concurrent flow in random bipartite graphs. - Fernando E. Vilas; Eli V. Olinick; David W. Matula (Optim. Lett., 2020)

IllumiCore: Optimization Modeling and Implementation for Efficient VNF Placement. - Leo Popokh; Jing Su 004; Suku Nair; Eli V. Olinick (SoftCOM, 2021)

Improving Sports Media's Crystal Ball for National Basketball Association Playoff Elimination. - Mark Husted; Eli V. Olinick; Alexandra M. Newman (INFORMS J. Appl. Anal., 2021)

A Composite Index Method for Optimization Benchmarking. - Yulan Bai; Eli V. Olinick (LION, 2022)

The Backhaul Profit Maximization Problem: Optimization Models and Solution Procedures. - Yuanyuan Dong; Yulan Bai; Eli V. Olinick; Andrew Junfang Yu (INFORMS J. Optim., 2022)

A Set Covering Approach for Selecting Preferred Systems to Support Mission Engineering. - Justin B. Brown; Eli V. Olinick (IEEE Syst. J., 2023)

Improving South Korea's Crystal Ball for Baseball Postseason Clinching and Elimination. - Sam Sung Ho Kim; Mark Husted; Eli V. Olinick; Alexandra M. Newman (INFORMS J. Appl. Anal., 2024)

Fast heuristics for the time-constrained immobile server problem. - Adam Q. Colley; Eli V. Olinick (Int. Trans. Oper. Res., 2025)