Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob H.-S. Tsao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j23]Hongrui Liu, Ayca Erdogan, Royce Lin, H.-S. Jacob Tsao:
Mathematical models of political districting for more representative governments. Comput. Ind. Eng. 140: 106265 (2020)- 2015
- [j22]H.-S. Jacob Tsao, Minnie H. Patel:
A general intuitive design pattern for optimally sequencing treatment combinations in 2k factorial experiment and a simple estimation algorithm. Comput. Ind. Eng. 85: 423-436 (2015) - 2013
- [j21]H.-S. Jacob Tsao, Minnie H. Patel:
An intuitive design pattern for sequentially estimating parameters of a 2k factorial experiment with active confounding avoidance and least treatment combinations. Comput. Ind. Eng. 66(3): 601-613 (2013) - 2011
- [j20]H.-S. Jacob Tsao, Agus Pratama:
A maximum-entropy approach to minimising resource contention in aircraft routing for optimisation of airport surface operations. Int. J. Inf. Decis. Sci. 3(4): 372-391 (2011) - 2010
- [j19]Wan-Tsu Wang, Hui-Ming Wee, H.-S. Jacob Tsao:
Revisiting the note on supply chain integration in vendor-managed inventory. Decis. Support Syst. 48(2): 419-420 (2010) - 2008
- [j18]H.-S. Jacob Tsao, Hongrui Liu:
Optimal sequencing of test conditions in 2k factorial experimental design for run-size minimization. Comput. Ind. Eng. 55(2): 450-464 (2008) - 2005
- [j17]H.-S. Jacob Tsao, Irene Wibowo:
A method for identifying a minimal set of test conditions in 2k experimental design. Comput. Ind. Eng. 48(1): 141-151 (2005) - 2002
- [j16]H.-S. Jacob Tsao, Jan L. Botha:
An Automated Highway System Dedicated to Inter-City Trucking: Design Options, Operating Concepts, and Deployment. J. Intell. Transp. Syst. 7(2): 169-196 (2002) - 2001
- [j15]H.-S. Jacob Tsao:
A Framework for Evaluating Deployment Strategies for Intelligent Transportation Systems. J. Intell. Transp. Syst. 6(2): 141-173 (2001) - [j14]Randolph W. Hall
, Ali Nowroozi, Jacob H.-S. Tsao:
Entrance Capacity of an Automated Highway System. Transp. Sci. 35(1): 19-36 (2001) - 1998
- [j13]H.-S. Jacob Tsao:
From the Guest Editor. J. Intell. Transp. Syst. 4(1-2): 5-8 (1998) - 1997
- [j12]Jacob H.-S. Tsao, Randolph W. Hall, Indrajit Chatterjee:
Analytical Models for Vehicle/Gap Distribution on Automated Highway Systems. Transp. Sci. 31(1): 18-33 (1997) - 1996
- [j11]Shu-Cherng Fang, Jacob H.-S. Tsao:
A dual perturbation view of linear programming. Math. Methods Oper. Res. 44(1): 1-9 (1996) - 1995
- [j10]H.-S. Jacob Tsao:
Constraints on initial AHS Deployment and the Concept Definition of a Shuttle Service for AHS Debut. J. Intell. Transp. Syst. 2(2): 159-173 (1995) - [j9]H.-S. Jacob Tsao:
A staggered-diamond Design for Automated/Manual-HOV Highway-to-Highway Interchanges. J. Intell. Transp. Syst. 2(3): 281-292 (1995) - [j8]H.-S. Jacob Tsao:
A staggered-diamond Design for Automated/Manual-HOV Highway-to-Highway Interchanges. J. Intell. Transp. Syst. 2(3): 312-315 (1995) - [j7]H.-S. Jacob Tsao:
Stage Definition for AHS Deployment and an AHS Evolutionary Scenario. J. Intell. Transp. Syst. 2(4): 359-382 (1995) - [j6]H.-S. Jacob Tsao:
Stage Definition for AHS Deployment and an Evolutionary Scenario. J. Intell. Transp. Syst. 2(4): 387-391 (1995) - [j5]Jacob H.-S. Tsao, Shu-Cherng Fang:
An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions. Math. Methods Oper. Res. 42(3): 325-343 (1995) - [j4]Wen-Jui Li, H.-S. Jacob Tsao, Osman Ulular:
The shortest path with at most / nodes in each of the series/parallel clusters. Networks 26(4): 263-271 (1995) - [j3]Shu-Cherng Fang, H.-S. Jacob Tsao:
Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems. Transp. Sci. 29(4): 353-365 (1995) - 1994
- [j2]H.-S. Jacob Tsao, Randolph W. Hall:
A Probabilistic Model for AVCs longitudinal Collision/ Safety Analysis. J. Intell. Transp. Syst. 1(3): 261-274 (1994) - 1993
- [j1]Shu-Cherng Fang, H.-S. Jacob Tsao:
Linear programming with entropic perturbation. ZOR Methods Model. Oper. Res. 37(2): 171-186 (1993)
Conference and Workshop Papers
- 2010
- [c1]H.-S. Jacob Tsao, Shrikant Parikh, Anindya S. Ghosh, Ritesh Pal, Madhura Ranalkar, Hanoz Tarapore, Shailaja Venkatsubramanyan:
Streamlining grain supply chains of India: Cloud computing and distributed hubbing for wholesale-retail logistics. SOLI 2010: 252-257
Reference Works
- 2009
- [r3]Shu-Cherng Fang, Jacob H.-S. Tsao:
Entropy Optimization: Interior Point Methods. Encyclopedia of Optimization 2009: 907-912 - [r2]Shu-Cherng Fang, Jacob H.-S. Tsao:
Entropy Optimization: Shannon Measure of Entropy and its Properties. Encyclopedia of Optimization 2009: 916-921 - [r1]Shu-Cherng Fang, Jacob H.-S. Tsao:
Maximum Entropy Principle: Image Reconstruction. Encyclopedia of Optimization 2009: 2004-2009
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-04-25 01:24 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:
