default search action
Eli V. Olinick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Sam Sung Ho Kim, Mark Husted, Eli V. Olinick
, Alexandra M. Newman
Improving South Korea's Crystal Ball for Baseball Postseason Clinching and Elimination. INFORMS J. Appl. Anal. 54(4): 298-311 (2024) - 2023
- [j21]Justin B. Brown
A Set Covering Approach for Selecting Preferred Systems to Support Mission Engineering. IEEE Syst. J. 17(4): 5616-5625 (2023) - 2022
- [j20]Yuanyuan Dong
The Backhaul Profit Maximization Problem: Optimization Models and Solution Procedures. INFORMS J. Optim. 4(4): 373-402 (2022) - [c3]Yulan Bai
A Composite Index Method for Optimization Benchmarking. LION 2022: 43-57 - 2021
- [j19]Mark Husted, Eli V. Olinick
Improving Sports Media's Crystal Ball for National Basketball Association Playoff Elimination. INFORMS J. Appl. Anal. 51(2): 119-135 (2021) - [c2]Leo Popokh, Jing Su, Suku Nair, Eli V. Olinick:
IllumiCore: Optimization Modeling and Implementation for Efficient VNF Placement. SoftCOM 2021: 1-7 - 2020
- [j18]Xinyi Ding
Swapped face detection using deep learning and subjective assessment. EURASIP J. Inf. Secur. 2020: 6 (2020) - [j17]Fernando E. Vilas
Bounds on maximum concurrent flow in random bipartite graphs. Optim. Lett. 14(8): 2197-2209 (2020)
2010 – 2019
- 2019
- [i1]Xinyi Ding, Zohreh Raziei, Eric C. Larson, Eli V. Olinick, Paul Krueger, Michael Hahsler:
Swapped Face Detection using Deep Learning and Subjective Assessment. CoRR abs/1909.04217 (2019) - 2016
- [c1]Pengfei Cui, Yuanyuan Dong, Hui Liu, Dinesh Rajan, Eli V. Olinick, Joseph Camp
WhiteMesh: Leveraging white spaces in wireless mesh networks. WiOpt 2016: 100-106 - 2015
- [j16]Yuanyuan Dong
A compact linear programming formulation of the maximum concurrent flow problem. Networks 65(1): 68-87 (2015) - 2014
- [j15]Reza Rahdar, Jerrell T. Stracener, Eli V. Olinick:
A Systems Engineering Approach to Improving the Accuracy of Mobile Station Location Estimation. IEEE Syst. J. 8(1): 14-22 (2014) - 2013
- [j14]Levent Kaan, Eli V. Olinick:
The Vanpool Assignment Problem: Optimization models and solution algorithms. Comput. Ind. Eng. 66(1): 24-40 (2013) - 2011
- [j13]Eli V. Olinick, Tauhid M. Rahman:
Incremental demand rerouting: optimization models and algorithms. Telecommun. Syst. 46(1): 61-80 (2011)
2000 – 2009
- 2008
- [j12]Eli V. Olinick, Jay M. Rosenberger:
Optimizing revenue in CDMA networks under demand uncertainty. Eur. J. Oper. Res. 186(2): 812-825 (2008) - [j11]Charles F. Mann, David W. Matula, Eli V. Olinick:
The use of sparsest cuts to reveal the hierarchical community structure of social networks. Soc. Networks 30(3): 223-234 (2008) - 2006
- [j10]Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
Base Station Location and Service Assignments in W - CDMA Networks. INFORMS J. Comput. 18(3): 366-376 (2006) - [j9]Giray Birkan, Jeffery L. Kennington, Eli V. Olinick, Augustyn Ortynski, Gheorghe Spiride:
Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures. Telecommun. Syst. 31(1): 61-83 (2006) - 2005
- [j8]Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
Hierarchical cellular network design with channel allocation. Eur. J. Oper. Res. 160(1): 3-18 (2005) - 2004
- [j7]Jeffery L. Kennington, Eli V. Olinick:
Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. INFORMS J. Comput. 16(2): 174-187 (2004) - 2003
- [j6]Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick:
SONET/SDH Ring Assignment with Capacity Constraints. Discret. Appl. Math. 129(1): 99-128 (2003) - [j5]D. Allen, Iszaidy Ismail
An Incremental Procedure for Improving Path Assignment in a Telecommunications Network. J. Heuristics 9(5): 375-399 (2003) - [j4]Jeffery L. Kennington, Eli V. Olinick, Augustyn Ortynski, Gheorghe Spiride:
Wavelength Routing and Assignment in a Survivable WDM Mesh Network. Oper. Res. 51(1): 67-79 (2003) - [j3]Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin
The SONET edge-partition problem. Networks 41(1): 13-23 (2003) - 2002
- [j2]Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick:
Baseball, Optimization, and the World Wide Web. Interfaces 32(2): 12-22 (2002) - 2001
- [j1]Dorit S. Hochbaum, Eli V. Olinick:
The Bounded Cycle-Cover Problem. INFORMS J. Comput. 13(2): 104-119 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: