Arie Hordijk
According to our database1,
Arie Hordijk
authored at least 44 papers
between 1974 and 2015.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2015
A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information.
Asia Pac. J. Oper. Res., 2015
2013
Discret. Event Dyn. Syst., 2013
2010
An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory.
Oper. Res., 2010
2009
2006
2005
Math. Oper. Res., 2005
Math. Methods Oper. Res., 2005
2004
IEEE Trans. Autom. Control., 2004
Math. Methods Oper. Res., 2004
The unbalance and bounds on the average waiting time for periodic routing to one queue.
Math. Methods Oper. Res., 2004
2003
Discrete-Event Control of Stochastic Networks - Multimodularity and Regularity.
Lecture notes in mathematics 1829, Springer, ISBN: 978-3-540-20358-2, 2003
2002
Discret. Event Dyn. Syst., 2002
2001
IEEE Trans. Autom. Control., 2001
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
2000
Queueing Syst. Theory Appl., 2000
Queueing Syst. Theory Appl., 2000
Proceedings of the 39th IEEE Conference on Decision and Control, 2000
1999
Blackwell optimality in the class of stationary policies in Markov decision chains with a Borel state space and unbounded rewards.
Math. Methods Oper. Res., 1999
Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards.
Math. Methods Oper. Res., 1999
1998
Math. Methods Oper. Res., 1998
1997
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards.
Math. Oper. Res., 1997
Optimal service control against worst case admission policies: A multichained stochastic game.
Math. Methods Oper. Res., 1997
1996
Math. Methods Oper. Res., 1996
Time-discretization for controlled Markov processes. II. A jump and diffusion application.
Kybernetika, 1996
Time-discretization for controlled Markov processes. I. General approximation results.
Kybernetika, 1996
1995
Queueing Syst. Theory Appl., 1995
1994
On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains.
Math. Oper. Res., 1994
Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy.
Math. Methods Oper. Res., 1994
Linear programming formulation of MDPs in countable state space: The multichain case.
Math. Methods Oper. Res., 1994
1992
Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains.
Math. Oper. Res., 1992
1988
Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards.
Math. Oper. Res., 1988
1987
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case.
Math. Oper. Res., 1987
Approximating Sensitive Queueing Networks by Reversible Markov Chains.
Proceedings of the Computer Performance and Reliability, 1987
1985
Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization.
Math. Oper. Res., 1985
1984
Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints.
Math. Program., 1984
Math. Oper. Res., 1984
1983
Insensitivity for Stochastic Networks.
Proceedings of the Computer Performance and Reliability, 1983
1977
Math. Oper. Res., 1977
1974
Technical Note - The Method of Successive Approximations and Markovian Decision Problems.
Oper. Res., 1974