Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARIS

Hevristike - teorija in aplikacije (Slovene)

Edit
Research activity

Code Science Field Subfield
2.07.07  Engineering sciences and technologies  Computer science and informatics  Intelligent systems - software 

Code Science Field
P110  Natural sciences and mathematics  Mathematical logic, set theory, combinatories 
Keywords
combinatorial optimization, graph theory, randomized heuristical algorithm, graph coloring, frequency assignment, traveling salesman problem, transportation problems, location problems
Evaluation (rules)
source: COBISS
Evaluation of bibliographic research performance indicators according to ARIS methodology
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (5)
no. Code Name and surname Research area Role Period No. of publications
1.  12066  PhD Janez Aleš  Mathematics  Researcher  1999 - 2001  17 
2.  02017  PhD Matevž Bren  Mathematics  Researcher  1999 - 2001  291 
3.  12303  PhD Simona Korenjak Černe  Mathematics  Researcher  1999 - 2001  126 
4.  15571  PhD Blaž Zmazek  Mathematics  Researcher  1999 - 2001  253 
5.  03430  PhD Janez Žerovnik  Mathematics  Head  1999 - 2001  805 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,227 
Abstract
Heuristic algorithms for optimization problems in general and on examples such as the graph coloring problem(s), the traveling salesman problem, the frequency assignment problem(s), etc., will be studied. The main working hypothesis is: repeated fast construction (or generation) and fast (local) optimization of feasible solutions is a promising general randomized heuristics for NP-hard problems.
Confirmation required
Views history
Favourite