default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames K. Ho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j25]James K. Ho:
Spreadsheet-Based Simulation Models for Decision Support: Case of Strategic Pairings in Sport Tournaments with Match Play for Team Competition. Informatica 23(3): 357-368 (2012)
2000 – 2009
- 2008
- [j24]James K. Ho:
Inter-brand comparison of online auction markets. Electron. Commer. Res. 8(1-2): 103-114 (2008) - [j23]James K. Ho:
Online Auction Markets in Tourism. J. Inf. Technol. Tour. 10(1): 19-29 (2008) - 2007
- [j22]James K. Ho, Sydney C. K. Chu, Sze Sing Lam:
Maximum Resolution Topology for Online Auction Markets. Electron. Mark. 17(2): 164-174 (2007) - [c5]James K. Ho, Sydney C. K. Chu, Sze Sing Lam:
Optimization model and DSS for maximum resolution dichotomies. ICINCO-ICSO 2007: 355-358 - 2006
- [c4]Yi Chen, Yuehong Sun, James K. Ho:
A Simple and Effective 3D Navigation System with 2D Map Guidance. CGVR 2006: 56-64 - [c3]Yi Chen, Yuehong Sun, James K. Ho:
A Simple and Effective 3D Navigation System with 2D Map Guidance. MSV 2006: 277-282 - 2005
- [j21]James K. Ho:
Global Diffusion of the Internet VIII: Maximum Resolution Dichotomy for Global Diffusion of the Internet. Commun. Assoc. Inf. Syst. 16: 39 (2005) - [j20]James K. Ho, Sydney C. K. Chu:
Maximum Resolution Topology for Multi-Attribute Dichotomies. Informatica 16(4): 557-570 (2005) - 2004
- [j19]James K. Ho:
Topological Analysis of Online Auction Markets. Electron. Mark. 14(3): 202-213 (2004) - [c2]James K. Ho:
A Global Comparative Study of Online Auction Markets. ICEB 2004: 239-244 - 2003
- [j18]S. Kingsley Gnanendran, James K. Ho, R. P. Sundarraj:
Stock selection heuristics for interdependent items. Eur. J. Oper. Res. 145(3): 585-605 (2003) - 2002
- [j17]James K. Ho:
Multilingual e-Business in a Global Economy: Case of SMEs in the Lodging Industry. J. Inf. Technol. Tour. 5(1): 3-11 (2002) - 2001
- [j16]James K. Ho:
A Study of Internet User Attitudes Toward Focused Broadcasting on the World Wide Web. Informatica 12(2): 285-296 (2001) - 2000
- [j15]James K. Ho:
Computing True Shadow Prices in Linear Programming. Informatica 11(4): 421-434 (2000) - [j14]James K. Ho:
Bridging the Academic Research and Business Practice with the New Media. Inf. Resour. Manag. J. 13(2): 6-14 (2000)
1990 – 1999
- 1999
- [j13]James K. Ho:
A Dynamic Growth Model for Focused Broadcasting over the Internet. Informatica 10(3): 275-288 (1999) - 1997
- [j12]James K. Ho, R. P. Sundarraj:
Distributed Nested Decomposition of Staircase Linear Programs. ACM Trans. Math. Softw. 23(2): 148-173 (1997) - 1994
- [j11]James K. Ho, R. P. Sundarraj:
On the efficacy of distributed simplex algorithms for linear programming. Comput. Optim. Appl. 3(4): 349-363 (1994) - [c1]Aditya N. Saharia, Terence M. Barron, Thomas J. Davenport, James K. Ho, Haim Mendelson:
Is There a Theory of Reengineering? ICIS 1994: 492-493 - 1993
- [j10]John R. Birge
, James K. Ho:
Optimal Flows in Stochastic Dynamic Networks with Congestion. Oper. Res. 41(1): 203-216 (1993) - [j9]S. Kingsley Gnanendran, James K. Ho:
Load balancing in the parallel optimization of block-angular linear programs. Math. Program. 62: 41-67 (1993) - [j8]James K. Ho, R. P. Sundarraj:
A timing model for the revised simplex method. Oper. Res. Lett. 13(2): 67-73 (1993)
1980 – 1989
- 1988
- [j7]James K. Ho, Tak C. Lee, R. P. Sundarraj:
Decomposition of linear programs using parallel computation. Math. Program. 42(1-3): 391-405 (1988) - 1986
- [j6]James K. Ho:
A Parametric Subproblem for Dual Methods in Decomposition. Math. Oper. Res. 11(4): 644-650 (1986) - 1983
- [j5]James K. Ho, Etienne Loute:
Computational experience with advanced implementation of decomposition algorithms for linear programming. Math. Program. 27(3): 283-290 (1983) - 1981
- [j4]James K. Ho, Etienne Loute:
A set of staircase linear programming test problems. Math. Program. 20(1): 245-250 (1981) - [j3]James K. Ho, Etienne Loute:
An advanced implementation of the Dantzig-Wolfe decomposition algorithm for linear programming. Math. Program. 20(1): 303-326 (1981) - 1980
- [j2]James K. Ho, Etienne Loute:
A Comparative Study of Two Methods for Staircase Linear Programs. ACM Trans. Math. Softw. 6(1): 17-30 (1980)
1970 – 1979
- 1974
- [j1]James K. Ho, Alan Manne:
Nested decomposition for dynamic models. Math. Program. 6(1): 121-140 (1974)
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 05:46 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:
