default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHossein Arsham
Person information
- affiliation: University of Baltimore, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j22]Hossein Arsham, Angappa Gunasekaran:
An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region. Int. J. Math. Oper. Res. 5(6): 663-692 (2013)- [j21]Hossein Arsham:
Modeling and simulation for product design process. Simul. 89(2): 178-191 (2013) - 2012
- [j20]Hossein Arsham:
Data Perturbation Analysis for IS Project Management Based on a Single Time Estimate. Int. J. Enterp. Inf. Syst. 8(4): 77-98 (2012) - [j19]Hossein Arsham:
Foundation of Linear Programming: A Managerial Perspective from Solving System of Inequalities to Software Implementation. Int. J. Strateg. Decis. Sci. 3(3): 40-60 (2012) - 2011
- [r1]Hossein Arsham, Miodrag Lovric:
Bartlett's Test. International Encyclopedia of Statistical Science 2011: 87-88
2000 – 2009
- 2008
- [p1]Hossein Arsham:
Gradient-Based Optimization Techniques for Discrete Event Systems Simulation. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j18]Hossein Arsham:
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs. Appl. Math. Comput. 188(1): 596-611 (2007) - [j17]Hossein Arsham, Janez Grad, Gasper Jaklic:
Perturbed matrix inversion with application to LP simplex method. Appl. Math. Comput. 188(1): 801-807 (2007) - [j16]Hossein Arsham:
A computationally stable solution algorithm for linear programs. Appl. Math. Comput. 188(2): 1549-1561 (2007) - [j15]Hossein Arsham:
Construction of the largest sensitivity region for general linear programs. Appl. Math. Comput. 189(2): 1435-1447 (2007) - [j14]Hossein Arsham:
Monte Carlo Techniques for Parametric Finite Multidimensional Integral Equations. Monte Carlo Methods Appl. 13(3): 173-195 (2007) - 2005
- [j13]Hossein Arsham, G. Cimperman, Nadja Damij, Talib Damij, Janez Grad:
A computer implementation of the Push-and-Pull algorithm and its computational comparison with LP simplex method. Appl. Math. Comput. 170(1): 36-63 (2005) - 2003
- [j12]Hossein Arsham, Miro Gradisar, Mojca Indihar Stemberger
:
Linearly constrained global optimization: a general solution algorithm with applications. Appl. Math. Comput. 134(2-3): 345-361 (2003) - [j11]Hossein Arsham, Talib Damij, Janez Grad:
An algorithm for simplex tableau reduction: the push-to-pull solution strategy. Appl. Math. Comput. 137(2-3): 525-547 (2003) - 2000
- [j10]Hossein Arsham:
The use of simulation in discrete-event dynamic systems design. Int. J. Syst. Sci. 31(5): 563-573 (2000)
1990 – 1999
- 1998
- [j9]Veena Adlakha, Hossein Arsham:
Managing cost uncertainties in transportation and assignment problems. Adv. Decis. Sci. 2(1): 65-104 (1998) - [j8]Hossein Arsham:
Techniques for Monte Carlo Optimizing. Monte Carlo Methods Appl. 4(3): 181-230 (1998) - [j7]Hossein Arsham:
Algorithms for sensitivity information in discrete-event systems simulation. Simul. Pract. Theory 6(1): 1-22 (1998) - 1997
- [j6]Hossein Arsham:
Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach. SIAM Rev. 39(4): 736-744 (1997) - 1996
- [j5]Hossein Arsham:
Performance extrapolation in discrete-event systems simulation. Int. J. Syst. Sci. 27(9): 863-869 (1996) - 1993
- [j4]Hossein Arsham:
A markovian model of consumer buying behavior and optimal advertising pulsing policy. Comput. Oper. Res. 20(1): 35-48 (1993) - 1992
- [j3]Veena G. Adlakha, Hossein Arsham:
A simulation technique for estimation in perturbed stochastic activity networks. Simul. 58(4): 258-267 (1992)
1980 – 1989
- 1988
- [j2]Hossein Arsham, David Dianich:
Consumer buying behavior and optimal advertising strategy: The quadratic profit function case. Comput. Oper. Res. 15(4): 299-310 (1988) - 1987
- [j1]Hossein Arsham:
A Stochastic model of optimal advertising pulsing policy. Comput. Oper. Res. 14(3): 231-239 (1987)
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-24 23:00 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:
