default search action
Jozef Kratica
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i2]Jozef Kratica, Vladimir Filipovic
, Dragan Matic, Aleksandar Kartelj:
An Integer Linear Programming Formulation for the Convex Dominating Set Problems. CoRR abs/1904.02541 (2019) - 2018
- [j25]Zoran Maksimovic, Jozef Kratica, Aleksandar Savic, Dragan Matic:
Solving the Multidimensional Maximum Bisection Problem by a Genetic Algorithm and Variable Neighborhood Search. J. Multiple Valued Log. Soft Comput. 31(4): 323-358 (2018) - 2017
- [j24]Dragan Matic, Jozef Kratica
Solving the minimum edge-dilation k-center problem by genetic algorithms. Comput. Ind. Eng. 113: 282-293 (2017) - [j23]Dragan Matic, Jozef Kratica
Variable neighborhood search for solving bandwidth coloring problem. Comput. Sci. Inf. Syst. 14(2): 309-327 (2017) - [j22]Zoran Maksimovic
Two metaheuristics for solving the connected multidimensional maximum bisection problem. Soft Comput. 21(21): 6453-6469 (2017) - 2015
- [i1]Dragan Matic, Jozef Kratica, Vladimir Filipovic:
Variable Neighborhood Search for solving Bandwidth Coloring Problem. CoRR abs/1505.06032 (2015) - 2014
- [j21]Jozef Kratica
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem. Comput. Oper. Res. 46: 59-68 (2014) - 2013
- [j20]Jozef Kratica
An electromagnetism-like metaheuristic for the uncapacitated multiple allocation p-hub median problem. Comput. Ind. Eng. 66(4): 1015-1024 (2013) - [j19]Vanja Miomir Korac, Jozef Kratica, Aleksandar Savic:
An Improved Genetic Algorithm for the Multi Level Uncapacitated Facility Location Problem. Int. J. Comput. Commun. Control 8(6): 845-853 (2013) - 2012
- [j18]Jozef Kratica
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl. Math. Comput. 218(19): 9790-9801 (2012) - [j17]Jozef Kratica
A genetic algorithm for the routing and carrier selection problem. Comput. Sci. Inf. Syst. 9(1): 49-62 (2012) - [j16]Jozef Kratica, Markus Leitner
Variable Neighborhood Search for Solving the Balanced Location Problem. Electron. Notes Discret. Math. 39: 21-28 (2012) - [j15]Nenad Mladenovic
Variable neighborhood search for the strong metric dimension problem. Electron. Notes Discret. Math. 39: 51-57 (2012) - [j14]Dragan Matic, Jozef Kratica, Vladimir Filipovic
Variable neighborhood search for Multiple Level Warehouse Layout Problem. Electron. Notes Discret. Math. 39: 161-168 (2012) - [j13]Nenad Mladenovic
Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur. J. Oper. Res. 220(2): 328-337 (2012) - [j12]Jozef Kratica:
An Electromagnetism-Like Approach for Solving the Low Autocorrelation Binary Sequence Problem. Int. J. Comput. Commun. Control 7(4): 688-695 (2012) - [c6]Vladimir Filipovic
The modification of genetic algorithms for solving the balanced location problem. BCI 2012: 243-246 - 2011
- [j11]Jozef Kratica
An evolutionary-based approach for solving a capacitated hub location problem. Appl. Soft Comput. 11(2): 1858-1866 (2011) - 2010
- [j10]Aleksandar Savic, Jozef Kratica
A mixed integer linear programming formulation of the maximum betweenness problem. Eur. J. Oper. Res. 206(3): 522-527 (2010)
2000 – 2009
- 2009
- [j9]Jozef Kratica
Computing the metric dimension of graphs by genetic algorithms. Comput. Optim. Appl. 44(2): 343-361 (2009) - [j8]Jozef Kratica
Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36(7): 2149-2159 (2009) - 2008
- [j7]Jozef Kratica, Dusan Tosic, Vladimir Filipovic:
Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm. Comput. Informatics 27(3): 341-354 (2008) - 2007
- [j6]Jozef Kratica
Two genetic algorithms for solving the uncapacitated single allocation p. Eur. J. Oper. Res. 182(1): 15-28 (2007) - [j5]Zorica Stanimirovic
Genetic algorithms for solving the discrete ordered median problem. Eur. J. Oper. Res. 182(3): 983-1001 (2007) - 2006
- [j4]Jozef Kratica, Zorica Stanimirovic
Solving the uncapacitated Multiple Allocation P-Hub Center Problem by Genetic Algorithm. Asia Pac. J. Oper. Res. 23(4): 425-437 (2006) - 2005
- [j3]Jozef Kratica, Zorica Stanimirovic, Dusan Tosic, Vladimir Filipovic:
Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem. Comput. Artif. Intell. 24(4): 427-440 (2005) - 2004
- [c5]Zoran Ognjanovic, Uros Midic, Jozef Kratica:
A Genetic Algorithm for Probabilistic SAT Problem. ICAISC 2004: 462-467 - 2003
- [c4]Jozef Kratica, Ivana Ljubic, Dusan Tosic:
A Genetic Algorithm for the Index Selection Problem. EvoWorkshops 2003: 280-290 - 2001
- [j2]Jozef Kratica, Dusan Tosic, Vladimir Filipovic
Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35(1): 127-142 (2001) - [c3]Zoran Ognjanovic, Jozef Kratica, Milos Milovanovic
A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report. ECSQARU 2001: 805-816 - 2000
- [c2]Ivana D. Ljubic
A genetic algorithm for the biconnectivity augmentation problem. CEC 2000: 89-96 - [c1]Ivana Ljubic, Günther R. Raidl, Jozef Kratica:
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650
1990 – 1999
- 1999
- [j1]Jozef Kratica:
Improving Performances of the Genetic Algorithm by Caching. Comput. Artif. Intell. 18(3): 271-283 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: