Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, ...
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...