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

Heuristics - theory and applications 3

Edit
Research activity

Code Science Field Subfield
2.07.00  Engineering sciences and technologies  Computer science and informatics   

Code Science Field
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
Keywords
algorithm, heuristics, optimization, network design, resource allocation,
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 (8)
no. Code Name and surname Research area Role Period No. of publications
1.  23201  PhD Iztok Banič  Mathematics  Researcher  2005 - 2008  0 
2.  21754  PhD Irena Hrastnik Ladinek  Mathematics  Researcher  2005 - 2007  0 
3.  26533  PhD Igor Pesek  Educational studies  Junior researcher  2006 - 2008  0 
4.  20495  PhD Petra Šparl  Mathematics  Researcher  2005 - 2008  0 
5.  23341  PhD Primož Šparl  Mathematics  Researcher  2006 - 2008  0 
6.  11666  PhD Aleksander Vesel  Computer intensive methods and applications  Researcher  2005 - 2008  0 
7.  15571  PhD Blaž Zmazek  Mathematics  Researcher  2005 - 2008  0 
8.  03430  PhD Janez Žerovnik  Mathematics  Head  2005 - 2008  0 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  1 
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. We are also interested in the existence of efficient algorithms on restricted domains.
Confirmation required
Views history
Favourite