Jozef Kratica

Orcid: 0000-0002-9752-0971

According to our database1, Jozef Kratica authored at least 32 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
An Integer Linear Programming Formulation for the Convex Dominating Set Problems.
CoRR, 2019

2018
Solving the Multidimensional Maximum Bisection Problem by a Genetic Algorithm and Variable Neighborhood Search.
J. Multiple Valued Log. Soft Comput., 2018

2017
Two metaheuristics for solving the connected multidimensional maximum bisection problem.
Soft Comput., 2017

Variable neighborhood search for solving bandwidth coloring problem.
Comput. Sci. Inf. Syst., 2017

Solving the minimum edge-dilation k-center problem by genetic algorithms.
Comput. Ind. Eng., 2017

2014
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem.
Comput. Oper. Res., 2014

2013
An Improved Genetic Algorithm for the Multi Level Uncapacitated Facility Location Problem.
Int. J. Comput. Commun. Control, 2013

An electromagnetism-like metaheuristic for the uncapacitated multiple allocation p-hub median problem.
Comput. Ind. Eng., 2013

2012
An Electromagnetism-Like Approach for Solving the Low Autocorrelation Binary Sequence Problem.
Int. J. Comput. Commun. Control, 2012

Variable neighborhood search for metric dimension and minimal doubly resolving set problems.
Eur. J. Oper. Res., 2012

Variable neighborhood search for the strong metric dimension problem.
Electron. Notes Discret. Math., 2012

Variable neighborhood search for Multiple Level Warehouse Layout Problem.
Electron. Notes Discret. Math., 2012

Variable Neighborhood Search for Solving the Balanced Location Problem.
Electron. Notes Discret. Math., 2012

A genetic algorithm for the routing and carrier selection problem.
Comput. Sci. Inf. Syst., 2012

Minimal doubly resolving sets and the strong metric dimension of some convex polytopes.
Appl. Math. Comput., 2012

The modification of genetic algorithms for solving the balanced location problem.
Proceedings of the Balkan Conference in Informatics, 2012, 2012

2011
An evolutionary-based approach for solving a capacitated hub location problem.
Appl. Soft Comput., 2011

2010
A mixed integer linear programming formulation of the maximum betweenness problem.
Eur. J. Oper. Res., 2010

2009
Computing minimal doubly resolving sets of graphs.
Comput. Oper. Res., 2009

Computing the metric dimension of graphs by genetic algorithms.
Comput. Optim. Appl., 2009

2008
Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm.
Comput. Informatics, 2008

2007
Genetic algorithms for solving the discrete ordered median problem.
Eur. J. Oper. Res., 2007

Two genetic algorithms for solving the uncapacitated single allocation p.
Eur. J. Oper. Res., 2007

2006
Solving the uncapacitated Multiple Allocation P-Hub Center Problem by Genetic Algorithm.
Asia Pac. J. Oper. Res., 2006

2005
Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem.
Comput. Artif. Intell., 2005

2004
A Genetic Algorithm for Probabilistic SAT Problem.
Proceedings of the Artificial Intelligence and Soft Computing, 2004

2003
A Genetic Algorithm for the Index Selection Problem.
Proceedings of the Applications of Evolutionary Computing, 2003

2001
Solving the simple plant location problem by genetic algorithm.
RAIRO Oper. Res., 2001

A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001

2000
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000

A genetic algorithm for the biconnectivity augmentation problem.
Proceedings of the 2000 Congress on Evolutionary Computation, 2000

1999
Improving Performances of the Genetic Algorithm by Caching.
Comput. Artif. Intell., 1999


  Loading...