Search Results - "Cangalovic, Mirjana"

Optimal treatment of agricultural land - special multi-depot vehicle routing problem by Andric Gusavac, Bisera, Stanojevic, Milan, Cangalovic, Mirjana

“…This paper describes a problem of optimal agricultural land treatment using aviation. The studied problem consists of determining the optimal routes for a…”
Get full text

Air traffic assignment to reduce population noise exposure using activity-based approach by Ganić, Emir, Babić, Obrad, Čangalović, Mirjana, Stanojević, Milan

“…•New noise abatement measure is proposed.•Air traffic assignment considers temporal and spatial variations in population.•Number of people highly annoyed by…”
Get full text

Minimal doubly resolving sets and the strong metric dimension of some convex polytopes by Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana, Stojanović, Milica

“…In this paper we consider two similar optimization problems on graphs: the strong metric dimension problem and the problem of determining minimal doubly…”
Get full text

General variable neighborhood search for the continuous optimization by MIADENOVIC, Nenad, DRAZIC, Milan, KOVACEVIC-VUJCIC, Vera, CANGALOVIC, Mirjana

“…We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search…”
Get full text

Anticipatory modulation of air navigation charges to balance the use of airspace network capacities by Jovanovic, Radosav, Tosic, Vojin, Cangalovic, Mirjana, Stanojevic, Milan

“…•We use charging incentives to align airlines’ route choices with available airspace capacities.•Method in accordance with EU legislation on ANS…”
Get full text

A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints by Đorđević, Lena, Antić, Slobodan, Čangalović, Mirjana, Lisec, Andrej

“…This paper considers the well-known static time-continuous multiproduct economic order quantity (EOQ) based inventory management problem with the storage space…”
Get full text

A metaheuristic approach to the dominating tree problem by Dražić, Zorica, Čangalović, Mirjana, Kovačević-Vujčić, Vera

“…This paper considers a recently introduced NP-hard problem on graphs, called the dominating tree problem. In order to solve this problem, we develop a variable…”
Get full text

Variable neighborhood search for metric dimension and minimal doubly resolving set problems by Mladenović, Nenad, Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana

“…► An efficient VNS to solving the MDP and MDRSP is presented. ► VNS approach is based on a decomposition with an auxiliary objective function. ► Local search…”
Get full text

Computing minimal doubly resolving sets of graphs by Kratica, Jozef, Čangalović, Mirjana, Kovačević-Vujčić, Vera

“…In this paper we consider the minimal doubly resolving sets problem (MDRSP) of graphs. We prove that the problem is NP-hard and give its integer linear…”
Get full text

Symmetry properties of resolving sets and metric bases in hypercubes by Nikolić, Nebojša, Čangalović, Mirjana, Grujičić, Igor

“…In this paper we consider some special characteristics of distances between vertices in the n -dimensional hypercube graph Q n and, as a consequence, the…”
Get full text

Minimal doubly resolving sets of prism graphs by Čangalović, Mirjana, Kratica, Jozef, Kovačević-Vujčić, Vera, Stojanović, Milica

“…In this paper, we consider the problem of determining the minimal cardinality of double resolving sets for prism graphs . It is proved that the minimal…”
Get full text

MINIMAL DOUBLY RESOLVING SETS AND THE STRONG METRIC DIMENSION OF HAMMING GRAPHS by Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana, Stojanović, Milica

“…We consider the problem of determining the cardinality Ψ(H2, k) of minimal doubly resolving sets of Hamming graphs H2,k We prove that for k ≥ 6 every minimal…”
Get full text

Strong metric dimension: A survey by Kratica Jozef, Kovačević-Vujčić Vera, Čangalović Mirjana, Mladenović Nenad

“…The strong metric dimension has been a subject of considerable amount of research in recent years. This survey describes the related development by bringing…”
Get full text

THE STRONG METRIC DIMENSION OF SOME GENERALIZED PETERSEN GRAPHS by Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana

“…In this paper the strong metric dimension of generalized Petersen graphs 𝐺𝑃(𝑛, 2) is considered. The exact value is determined for the cases 𝑛 = 4𝑘 and 𝑛…”
Get full text

Complexity indices for the traveling salesman problem based on short edge subgraphs by Cvetković, Dragoš, Čangalović, Mirjana, Dražić, Zorica, Kovačević-Vujčić, Vera

“…We present the extension of our previous work on complexity indices for the traveling salesman problem (TSP). Since we study the symmetric traveling salesman…”
Get full text

Computing the metric dimension of graphs by genetic algorithms by Kratica, Jozef, Kovačević-Vujčić, Vera, Čangalović, Mirjana

“…In this paper we consider the NP-hard problem of determining the metric dimension of graphs. We propose a genetic algorithm (GA) that uses the binary encoding…”
Get full text

Finding minimal branchings with a given number of arcs by Cvetković Dragoš M., Čangalović Mirjana M.

“…We describe an algorithm for finding a minimal s-branching (where s is a given number of its arcs) in a weighted digraph with an a symetric weight matrix. The…”
Get full text

About equivalent interval colorings of weighted graphs by Bouchard, Mathieu, Čangalović, Mirjana, Hertz, Alain

“…Given a graph G = ( V , E ) with strictly positive integer weights ω i on the vertices i ∈ V , a k -interval coloring of G is a function I that assigns an…”
Get full text

On a reduction of the interval coloring problem to a series of bandwidth coloring problems by Bouchard, Mathieu, Čangalović, Mirjana, Hertz, Alain

“…Given a graph G =( V , E ) with strictly positive integer weights ω i on the vertices i ∈ V , an interval coloring of G is a function I that assigns an…”
Get full text

Computing strong metric dimension of some special classes of graphs by genetic algorithms by Kratica Jozef, Kovačević-Vujčić Vera, Čangalović Mirjana

“…In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses…”
Get full text