default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArie Hordijk
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j39]Wim Hordijk, Arie Hordijk, Bernd Heidergott
:
A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information. Asia Pac. J. Oper. Res. 32(3): 1550015:1-1550015:20 (2015)- 2013
- [j38]Haralambie Leahu, Bernd Heidergott, Arie Hordijk:
Perturbation analysis of waiting times in the G/G/1 queue. Discret. Event Dyn. Syst. 23(3): 277-305 (2013) - 2010
- [j37]Bernd Heidergott, Arie Hordijk, Nicole Leder:
Series Expansions for Continuous-Time Markov Processes. Oper. Res. 58(3): 756-767 (2010) - [j36]Nicole Leder, Bernd Heidergott, Arie Hordijk:
An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory. Oper. Res. 58(4-Part-1): 918-932 (2010)
2000 – 2009
- 2009
- [j35]Bernd Heidergott, Arie Hordijk, Haralambie Leahu:
Strong bounds on perturbations. Math. Methods Oper. Res. 70(1): 99-127 (2009) - 2006
- [j34]Bernd Heidergott, Arie Hordijk, Heinz Weisshaupt:
Measure-Valued Differentiation for Stationary Markov Chains. Math. Oper. Res. 31(1): 154-172 (2006) - 2005
- [j33]S. Gajrat, Arie Hordijk:
On the structure of the optimal server control for fluid networks. Math. Methods Oper. Res. 62(1): 55-75 (2005) - [j32]Arie Hordijk, Dinard van der Laan:
On the Average Waiting Time for Regular Routing to Deterministic Queues. Math. Oper. Res. 30(2): 521-544 (2005) - 2004
- [j31]Arie Hordijk, Dinard van der Laan:
The unbalance and bounds on the average waiting time for periodic routing to one queue. Math. Methods Oper. Res. 59(1): 1-23 (2004) - [j30]Arie Hordijk, Dinard van der Laan:
Periodic routing to parallel queues and billiard sequences. Math. Methods Oper. Res. 59(2): 173-192 (2004) - [j29]Bernd Heidergott, Arie Hordijk:
Single-run gradient estimation via measure-valued differentiation. IEEE Trans. Autom. Control. 49(10): 1843-1847 (2004) - 2003
- [b1]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Discrete-Event Control of Stochastic Networks - Multimodularity and Regularity. Lecture notes in mathematics 1829, Springer 2003, ISBN 978-3-540-20358-2, pp. I-XIV, 1-313 - 2002
- [j28]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Regular Ordering and Applications in Control Policies. Discret. Event Dyn. Syst. 12(2): 187-210 (2002) - 2001
- [j27]Arie Hordijk, Adam Shwartz:
Performance bounds for queues via generating functions. IEEE Trans. Autom. Control. 46(1): 137-142 (2001) - [c4]Arie Hordijk, D. A. van der Laan:
Bounds for Deterministic Periodic Routing Sequences. IPCO 2001: 236-250 - 2000
- [j26]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Balanced sequences and optimal routing. J. ACM 47(4): 752-775 (2000) - [j25]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Multimodularity, Convexity, and Optimization Properties. Math. Oper. Res. 25(2): 324-347 (2000) - [j24]A. Gajrat, Arie Hordijk:
Fluid approximation of a controlled multiclass tandem network. Queueing Syst. Theory Appl. 35(1-4): 349-380 (2000) - [j23]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Optimal Open-Loop Control of Vacations, Polling and Service Assignment. Queueing Syst. Theory Appl. 36(4): 303-325 (2000) - [j22]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Admission control in stochastic event graphs. IEEE Trans. Autom. Control. 45(5): 854-867 (2000) - [c3]Eitan Altman, Bruno Gaujal, Arie Hordijk:
Simplex convexity, with application to open loop stochastic control in networks. CDC 2000: 1852-1857
1990 – 1999
- 1999
- [j21]Arie Hordijk, Alexander Yushkevich:
Blackwell optimality in the class of stationary policies in Markov decision chains with a Borel state space and unbounded rewards. Math. Methods Oper. Res. 49(1): 1-39 (1999) - [j20]Arie Hordijk, Alexander Yushkevich:
Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards. Math. Methods Oper. Res. 50(3): 421-448 (1999) - 1998
- [j19]Arie Hordijk, Anneke Loeve, Jeroen Tiggelman:
Analysis of a finite-source customer assignment model with no state information. Math. Methods Oper. Res. 47(2): 317-336 (1998) - 1997
- [j18]Arie Hordijk, Olaf Passchier, Floske Spieksma:
Optimal service control against worst case admission policies: A multichained stochastic game. Math. Methods Oper. Res. 45(2): 281-301 (1997) - [j17]Eitan Altman, Arie Hordijk, F. M. Spieksma:
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards. Math. Oper. Res. 22(3): 588-618 (1997) - 1996
- [j16]Nico M. van Dijk, Arie Hordijk:
Time-discretization for controlled Markov processes. I. General approximation results. Kybernetika 32(1): 1-16 (1996) - [j15]Nico M. van Dijk, Arie Hordijk:
Time-discretization for controlled Markov processes. II. A jump and diffusion application. Kybernetika 32(2): 139-158 (1996) - [j14]Eitan Altman, Arie Hordijk, Lodewijk C. M. Kallenberg:
On the value function in constrained control of Markov chains. Math. Methods Oper. Res. 44(3): 387-399 (1996) - 1995
- [j13]Eitan Altman, Arie Hordijk:
Zero-sum Markov games and worst-case optimal control of queueing systems. Queueing Syst. Theory Appl. 21(3-4): 415-447 (1995) - 1994
- [j12]Arie Hordijk, Jean B. Lasserre:
Linear programming formulation of MDPs in countable state space: The multichain case. Math. Methods Oper. Res. 40(1): 91-108 (1994) - [j11]Arie Hordijk, J. A. Loeve:
Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy. Math. Methods Oper. Res. 40(2): 163-181 (1994) - [j10]Rommert Dekker, Arie Hordijk, F. M. Spieksma:
On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains. Math. Oper. Res. 19(3): 539-559 (1994) - 1992
- [j9]Rommert Dekker, Arie Hordijk:
Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains. Math. Oper. Res. 17(2): 271-289 (1992)
1980 – 1989
- 1988
- [j8]Rommert Dekker, Arie Hordijk:
Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards. Math. Oper. Res. 13(3): 395-420 (1988) - 1987
- [j7]Arie Hordijk, Martin L. Puterman:
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case. Math. Oper. Res. 12(1): 163-176 (1987) - [c2]Arie Hordijk, Ad Ridder:
Approximating Sensitive Queueing Networks by Reversible Markov Chains. Computer Performance and Reliability 1987: 105-117 - 1985
- [j6]Arie Hordijk, Frank A. Van der Duyn Schouten:
Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization. Math. Oper. Res. 10(1): 160-173 (1985) - 1984
- [j5]Arie Hordijk, Frank A. Van der Duyn Schouten:
Discretization and Weak Convergence in Markov Decision Drift Processes. Math. Oper. Res. 9(1): 112-141 (1984) - [j4]Arie Hordijk, Lodewijk C. M. Kallenberg:
Constrained Undiscounted Stochastic Dynamic Programming. Math. Oper. Res. 9(2): 276-289 (1984) - [j3]Arie Hordijk, Lodewijk C. M. Kallenberg:
Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints. Math. Program. 30(1): 46-70 (1984) - [e1]Giuseppe Iazeolla, Pierre-Jacques Courtois, Arie Hordijk:
Computer Performance and Reliability, Proceedings of the International Workshop, Pisa, Italy, September 26-30, 1983. North-Holland 1984, ISBN 0-444-86892-5 [contents] - 1983
- [c1]Arie Hordijk:
Insensitivity for Stochastic Networks. Computer Performance and Reliability 1983: 77-94
1970 – 1979
- 1977
- [j2]Arie Hordijk, Karel Sladký:
Sensitive Optimality Criteria in Countable State Dynamic Programming. Math. Oper. Res. 2(1): 1-14 (1977) - 1974
- [j1]Arie Hordijk, Henk C. Tijms:
Technical Note - The Method of Successive Approximations and Markovian Decision Problems. Oper. Res. 22(3): 519-521 (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:53 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:
