Št. zadetkov: 34
Izvirni znanstveni članek
Oznake:
balanced domination number;d-balanced graphs;layer label-sum technique;
This paper addresses two open questions posed in Xu et al. (2021) regarding the balanced domination number in graphs. We show that three new classes of graphs—those of convex polytopes An, Dn, and R_n''--are d-balanced. Further, we provide a characterization of d-balancedness for rooted trees with t ...
Leto:
2027
Vir:
Univerza v Novi Gorici (UNG)
Izvirni znanstveni članek
Oznake:
symbolic regression;iterated local search;ordinary least squares;ground-truth benchmark sets;
In this paper, we solve the well-known symbolic regression problem that has been
intensively studied and has a wide range of applications. To solve it, we propose an
efficient metaheuristic-based approach, called RILS-ROLS. RILS-ROLS is based on the
following two elements: (i) iterated local sear ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
Roman domination;Petersen graphs;convex polytopes;
A double Roman domination function (DRDF) on a graph is a mapping satisfying the conditions: (i) each vertex with 0 assigned is adjacent to a vertex with 3 assigned or at least two vertices with 2 assigned and (ii) each vertex with 1 assigned is adjacent to at least one vertex with 2 or 3 assigned. ...
Leto:
2025
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
graph domination problems;variable neighborhood search;simultaneous attacks;ad-hoc wireless networks;
This work focuses on developing a meta-heuristic approach to protect network nodes from simultaneous attacks, specifically addressing the k-strong Roman domination problem. The objective is to assign integer weights to the nodes, representing the number of stationed armies, to meet protection constr ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
Roman domination;signed Roman domination;signed total Roman domination;convex polytopes;
In last two decades, the basic Roman domination problem and the variants thereof have attracted many researchers from different fields to study these problems in both ways, theoretically and computationally. Function f:V→{−1,1,2} is the signed Roman domination function (SRDF) if and only if it satis ...
Leto:
2024
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
number partitioning problem;hybrid metaheuristics;MILP models;local search;
The multidimensional multi-way number partitioning problem takes as input a set of n vectors with a fixed dimension m≥2, and aims to find a partitioning of this set into k≥2 non-empty subsets, such that the sums per coordinate across all subsets are as similar as possible. The problem has applicatio ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
combinatorial optimization;metaheuristics;graph domination;variable neighborhood search;
In this paper we are concerned with solving a generalized version of the well-known minimum dominating set problem, the so-called k-domination problem, k ∈ ℕ. This problem is about finding a minimal cardinality subset D of vertices of a graph G = (V, E) such that every υ ∈ V belongs to D or has at l ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
mixed integer linear programming;partitioning problems;mathematical modelling;
The multidimensional multi-way number partitioning problem considers a set of n vectors of a fixed dimension as an input. The goal is to find partitioning of the set into subsets such that sums per each coordinate in each subset are as nearly equal as possible. The problem has applications in key en ...
Leto:
2022
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
longest common subsequence problem;hybrid metaheuristic;beam search;anytime column search;
The Longest Common Subsequence (LCS) problem aims at finding a longest string that is a subsequence of each string from a given set of input strings. This problem has applications, in particular, in the context of bioinformatics, where strings represent DNA or protein sequences. Existing approaches ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
social contagion model;fire spread simulation;mixed integer linear programming;
Relying on a simplified model of fire spread, the Graph Burning Problem is an NP-hard combinatorial optimization problem that yields a metric of social contagion or vulnerability of a network. It concerns a discrete-time process on a simple undirected graph, with, in each timestep, a diffusion phase ...
Leto:
2026
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)