This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

In this paper we develop a new and efficient method for variational inequality with Lipschitz continuous strongly monotone operator. Our analysis is based on a new strongly convex merit function. We apply a variant of the developed scheme for solving quasivariational inequality. As a result, we...

We examine an auction model where there are many different goods, each good has multiple units, and bidders have gross substitutes valuations over the goods. We analyze the number of iterations in iterative auction algorithms for the model based on the theory of discrete convex analysis. By...

This paper investigates the sectoral and export structures as well as the product spaces of 11 economies in Central, East and Southeast Europe (CESEE). We first employ an analysis based on revealed comparative advantages (RCAs) to identify promising sectors for future growth and then combine...

This paper investigates the sectoral and export structures as well as the product spaces of 11 economies in Central, East and Southeast Europe (CESEE). We first employ an analysis based on revealed comparative advantages (RCAs) to identify promising sectors for future growth and then combine...