Jozef Kratica

From MaRDI portal
Person:336993

Available identifiers

zbMath Open kratica.jozef-jMaRDI QIDQ336993

List of research outcomes





PublicationDate of PublicationType
SOME PROPERTIES OF {k}-PACKING FUNCTION PROBLEM IN GRAPHS2024-04-11Paper
A new lower bound for doubly metric dimension and related extremal differences2023-10-09Paper
The strong metric dimension of some generalized Petersen graphs2023-09-05Paper
K-metric antidimension of some generalized Petersen graphs2022-06-03Paper
Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs2021-06-30Paper
Some new general lower bounds for mixed metric dimension of graphs2020-07-11Paper
https://portal.mardi4nfdi.de/entity/Q52122812020-01-28Paper
Edge metric dimension of some generalized Petersen graphs2019-12-16Paper
A new mixed integer linear programming model for the multi level uncapacitated facility location problem2018-12-07Paper
Strong metric dimension: A survey2017-04-11Paper
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem2016-11-10Paper
A new nonlinear model for the two-dimensional rectangle packing problem2014-11-14Paper
A new genetic representation for quadratic assignment problem2014-04-25Paper
An electromagnetism-like method for the maximum set splitting problem2014-03-26Paper
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs2014-02-07Paper
A mixed integer quadratic programming model for the low autocorrelation binary sequence problem2014-01-21Paper
Minimal doubly resolving sets of prism graphs2013-12-19Paper
Solving the maximally balanced connected partition problem in graphs by using genetic algorithm2013-08-29Paper
Variable neighborhood search for solving the balanced location problem2013-07-23Paper
Variable neighborhood search for the strong metric dimension problem2013-07-23Paper
Variable neighborhood search for multiple level warehouse layout problem2013-07-23Paper
https://portal.mardi4nfdi.de/entity/Q49249872013-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49281672013-06-10Paper
Variable neighborhood search for metric dimension and minimal doubly resolving set problems2012-12-29Paper
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes2012-08-19Paper
https://portal.mardi4nfdi.de/entity/Q31059632011-12-19Paper
https://portal.mardi4nfdi.de/entity/Q31058362011-12-19Paper
https://portal.mardi4nfdi.de/entity/Q31723782011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q30893282011-08-24Paper
https://portal.mardi4nfdi.de/entity/Q30160132011-07-13Paper
A mixed integer linear programming formulation of the maximum betweenness problem2010-06-11Paper
Computing the metric dimension of graphs by genetic algorithms2010-02-24Paper
Computing strong metric dimension of some special classes of graphs by genetic algorithms2009-12-04Paper
Computing minimal doubly resolving sets of graphs2009-04-17Paper
https://portal.mardi4nfdi.de/entity/Q36203872009-04-14Paper
Genetic algorithms for solving the discrete ordered median problem2007-06-13Paper
Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem2007-05-11Paper
https://portal.mardi4nfdi.de/entity/Q34246182007-03-07Paper
SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM2007-02-08Paper
Artificial Intelligence and Soft Computing - ICAISC 20042005-04-12Paper
https://portal.mardi4nfdi.de/entity/Q48158792004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q44515042004-02-26Paper
https://portal.mardi4nfdi.de/entity/Q44515302004-02-26Paper
https://portal.mardi4nfdi.de/entity/Q44183872003-08-10Paper
https://portal.mardi4nfdi.de/entity/Q47953572003-02-24Paper
https://portal.mardi4nfdi.de/entity/Q47848872002-12-12Paper
https://portal.mardi4nfdi.de/entity/Q31532232002-11-05Paper
Solving the simple plant location problem by genetic algorithm2002-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45296342002-05-05Paper
Solving a semidefinite relaxation of the traveling salesman problem.2002-01-01Paper

Research outcomes over time

This page was built for person: Jozef Kratica