In this note we present an efficient exact algorithm to solve the joint pricing and inventory problem for which Bhattacharjee and Ramesh (2000) proposed two heuristics. Our algorithm appears to be superior also in terms of computation time. Furthermore, we point out several mistakes in the paper by Bhattacharjee and Ramesh.

In this paper, we investigate the convergence of a novel simulation scheme to the target diffusion process. This scheme, the Quasi-EA, is closely related to the Exact Algorithm (EA) for diffusion processes, as it is obtained by neglecting the rejection step in EA. We prove the existence of a myopic coupling between the QuasiEA and the diffusion. Moreover, an upper bound for the coupling probabi...

In the Dial-a-Ride Problem (DARP), a fleet of vehicles must serve transportation requests made by users that need to be transported from an origin to a destination. In this paper we develop the first exact algorithm which is able to either efficiently prove the infeasibility or to provide a feasible solution. Such an algorithm could be used in a dynamic setting for determining whether it is pos...

Recent advances in algorithms for the multidimensional multiple choice knapsack problems have enabled us to solve rather large problem instances. However, these algorithms are evaluated with very limited benchmark instances. In this study, we propose new methods to systematically generate comprehensive benchmark instances. Some instances with special correlation properties between parameters ar...

We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.