Dejan Brcanov

University of Novi Sad · Faculty of Economics

Lignocellulosic bioethanol (LCB) is a biofuel produced from the nonfood feedstock, with the great potential of greenhouse gases (GHG) emissions savings. Crop residues are considered to be suitable feedstock for its production, however, the amount of the feedstock needed for a production is large, making the supply of the plant rather complex and ex...

In this paper we study a problem that arose while planning the delivery of perishable goods, such as newspapers or foodstuff, in urban areas. The customers require the delivery of several different products within specified time windows. Given a production schedule, facilities for cross docking and a vehicle fleet, the problem is to create a cost e...

Globalization and the growing number of EU states have created new challenges for European transport. The Danube Inland Harbor Development (DaHar) project recognized the constantly growing Asia-Europe container flows and liner services as one of the biggest opportunities for the development of intermodal transport in the Danube region which should...

The location problem considered in this paper concerns the optimal number, size, and location of public logistic centers. To solve this problem, a mathematical model is developed based on an expanded capacity-limited fixed cost location-allocation model of a network incorporating handling costs and the costs of the temporary storage of cargo in the...

Vojvodina is an agricultural, energy-deficient province of Serbia. The Provincial authorities strongly encourage implementation of renewable energy sources, particularly electricity generation. Based on the biomass study about 5% of the total electricity consumption is targeted for generation from biomass, which can be obtained from a total power p...

Let t = (t(1), t(2), ... t(n)) and c = (c(1,) c(2) ... c(n)) be two n-tuples of nonnegative integers. An all-4-kings n-partite tournament T(v(1), v(2), ... V(n)) is said to have a (t, c)-property if there exists an n-partite tournament T(1) (W(1), W(2) ... W(n)) such that for each i is an element of{1, ..., n}: (1) V(i) subset of W(i); (2) exactly...

A vertex nu is an s-king of an hypertournament T if the distance from nu to every other vertex of T is at most s. We consider 1-kings and 2-kings of hypertournaments. In some properties they follow corresponding kings of ordinary tournaments. In some other they are completely different.

A vertex v is an s‐king of a digraph D if the distance from v to every other vertex of D is at most s. We discuss various questions concerning s‐kings in multipartite tournaments and hypertournaments for s = 1, 2, 3, 4.

Changes in the period of economic transition in Serbia and Vojvodina region are leading to a significant disparities at regional and sub regional level on the labour market during the last decade. The purpose of this paper is to define the basic factors and directions of potential labour migrations in the region of Vojvodina among sub regions (coun...